Recognised as Number
738,937,948,225
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
738,937,948,225 is an odd 12-digit integer and a composite number. It has 9 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value738,937,948,225
Digit count12
Digit sum67
Digit product182,891,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 859,615²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5^2 × 171,923^2
Distinct prime factors25, 171,923
Number of divisors9
Sum of divisors σ(n)916,288,385,443
Aliquot sum177,350,437,218sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)591,146,920,120integers below n that share no factor with it
Carmichael function λ(n)295,573,460,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 591,146,920,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 171,923, 859,615, 4,298,075, 29,557,517,929, 147,787,589,645, 738,937,948,2259 in total
Arithmetic
Previous number738,937,948,224
Next number738,937,948,226
Double1,477,875,896,450
Square546,029,291,326,972,780,650,625
Cube403,481,764,203,904,054,134,395,818,063,890,625
Square root859,615exact
Cube root9,040.712461408≈
Negation-738,937,948,225
Reciprocal1.35329361 × 10^-12≈
Representations
Decimal738,937,948,225
Binary101011000000110000100010010010000100000140 bits
Octal12601410444101
HexadecimalAC0C224841
Base 369FGOKPXD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and thirty-eight billion, nine hundred and thirty-seven million, nine hundred and forty-eight thousand, two hundred and twenty-five
Ordinalseven hundred and thirty-eight billion, nine hundred and thirty-seven million, nine hundred and forty-eight thousand, two hundred and twenty-fifth
Scientific notation7.38937948 × 10^11
Engineering notation738.937948 × 10^9
In other bases
Ternary2121122022212010010002111base 3; the most digit-efficient integer base after e: 25 digits
Quinary44101321103320400base 5; one hand: 17 digits
Septenary104246366632321base 7: 15 digits
Nonary2548285103074base 9; each digit is two ternary digits: 13 digits
Duodecimalbb2649a7541base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal18h5i23ab5base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal15:50:16:49:1:10:25base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T0TT0T1000TT01001001T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110000011100011001100101100001000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001010110000001100001000100100100001000001
Bit length40 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits28within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes5ac 0c 22 48 41
Gray code1111101000001010001100110110110001100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001010110000001100001000100100100001000001
One's complement1111111111111111111111110101001111110011110111011011011110111110at 64 bits, every bit flipped
Bits reversed1000001000010010010001000011000000110101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010101100000011000010001001001000010000010at 64 bits, wrapping
Shifted left by 110101100000011000010001001001000010000010= 1,477,875,896,450, no wrap
Shifted right by 1101011000000110000100010010010000100000= 369,468,974,112, discarding the low bit
These bits as a double3.65083855 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
738,937,948,225 to the power 2546,029,291,326,972,780,650,625
738,937,948,225 to the power 3403,481,764,203,904,054,134,395,818,063,890,625
738,937,948,225 to the power 4298147986987036112296829774200… (48 digits)
738,937,948,225 to the power 5220312861771614464494600085519… (60 digits)
First ten multiples738,937,948,225, 1,477,875,896,450, 2,216,813,844,675, 2,955,751,792,900, 3,694,689,741,125, 4,433,627,689,350, 5,172,565,637,575, 5,911,503,585,800, 6,650,441,534,025, 7,389,379,482,250
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 25
Collatz (3n + 1) trajectory
Steps to reach 1342the total stopping time
Highest value reached2,216,813,844,6763× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps738,937,948,225 → 2,216,813,844,676 → 1,108,406,922,338 → 554,203,461,169 → 1,662,610,383,508 → 831,305,191,754 → 415,652,595,877 → 1,246,957,787,632 → 623,478,893,816 → 311,739,446,908 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage73,893,794,822,500%
738,937,948,225% as a decimal7,389,379,482.25
738,937,948,225% of 100738,937,948,225
738,937,948,225% of 1,0007,389,379,482,250
As a fraction of 100738,937,948,225/100
Read another way
As seconds23,415 years, 193 days and 19 hours
As bytes688.19 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 738,937,948,225
Nearby primes
Also reads as
738937948225 (identifier)
- 12 characters
- Checksum fails
738937948225 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page