Recognised as Number
31,662,487,525,249
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
31,662,487,525,249 is an odd 14-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value31,662,487,525,249
Digit count14
Digit sum64
Digit product174,182,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 5,626,943²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2 × 803,849^2
Distinct prime factors27, 803,849
Number of divisors9
Sum of divisors σ(n)36,831,919,063,107
Aliquot sum5,169,431,537,858sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)27,139,241,259,984integers below n that share no factor with it
Carmichael function λ(n)13,569,620,629,992the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,139,241,259,984
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 49, 803,849, 5,626,943, 39,388,601, 646,173,214,801, 4,523,212,503,607, 31,662,487,525,2499 in total
Arithmetic
Previous number31,662,487,525,248
Next number31,662,487,525,250
Double63,324,975,050,498
Square1,002,513,116,286,548,544,412,512,001
Cube31,742,059,038,321,343,378,723,420,273,134,003,013,249
Square root5,626,943exact
Cube root31,636.008039204≈
Negation-31,662,487,525,249
Reciprocal3.15831155 × 10^-14≈
Representations
Decimal31,662,487,525,249
Binary11100110010111111111101010010010101111000000145 bits
Octal714577724453601
Hexadecimal1CCBFF525781
Base 36B81JNKKG1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-one trillion, six hundred and sixty-two billion, four hundred and eighty-seven million, five hundred and twenty-five thousand, two hundred and forty-nine
Ordinalthirty-one trillion, six hundred and sixty-two billion, four hundred and eighty-seven million, five hundred and twenty-five thousand, two hundred and forty-ninth
Scientific notation3.16624875 × 10^13
Engineering notation31.662488 × 10^12
In other bases
Ternary11011002220102012021102100101base 3; the most digit-efficient integer base after e: 29 digits
Quinary13122224233301301444base 5; one hand: 20 digits
Septenary6445352646242200base 7: 16 digits
Nonary134086365242311base 9; each digit is two ternary digits: 15 digits
Duodecimal367449b013401base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal31gg6770d29base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal11:18:38:13:10:23:40:49base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary110110100T011T1TT1T111T100101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011011101110000000011010101111010100010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000111001100101111111111010100100101011110000001
Bit length45 bitsto write the magnitude
Set bits26the population count, or Hamming weight
Zero bits19within that length
Bit parityeven26 set bits, so even; not the same as the number itself being odd
Highest set bitbit 44worth 17,592,186,044,416
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes61c cb ff 52 57 81
Gray code100101010111000000000111110110111110001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000111001100101111111111010100100101011110000001
One's complement1111111111111111111000110011010000000000101011011010100001111110at 64 bits, every bit flipped
Bits reversed1000000111101010010010101111111111010011001110000000000000000000at 64 bits
Rotated left by 10000000000000000001110011001011111111110101001001010111100000010at 64 bits, wrapping
Shifted left by 11110011001011111111110101001001010111100000010= 63,324,975,050,498, no wrap
Shifted right by 111100110010111111111101010010010101111000000= 15,831,243,762,624, discarding the low bit
These bits as a double1.56433473 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime22
Nearest square below31,662,487,525,249
Nearest square above31,662,498,779,136
Powers & multiples
31,662,487,525,249 to the power 21,002,513,116,286,548,544,412,512,001
31,662,487,525,249 to the power 3317420590383213433787234202731… (41 digits)
31,662,487,525,249 to the power 4100503254832656680437061365932… (55 digits)
31,662,487,525,249 to the power 5318218305238591341739969855992… (68 digits)
First ten multiples31,662,487,525,249, 63,324,975,050,498, 94,987,462,575,747, 126,649,950,100,996, 158,312,437,626,245, 189,974,925,151,494, 221,637,412,676,743, 253,299,900,201,992, 284,962,387,727,241, 316,624,875,252,490
Powers of twoBetween 2^44 (17,592,186,044,416) and 2^45 (35,184,372,088,832)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1407the total stopping time
Highest value reached4,935,276,550,050,964155× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps31,662,487,525,249 → 94,987,462,575,748 → 47,493,731,287,874 → 23,746,865,643,937 → 71,240,596,931,812 → 35,620,298,465,906 → 17,810,149,232,953 → 53,430,447,698,860 → 26,715,223,849,430 → 13,357,611,924,715 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3.16624875 × 10^15%
31,662,487,525,249% as a decimal316,624,875,252.49
31,662,487,525,249% of 10031,662,487,525,249
31,662,487,525,249% of 1,000316,624,875,252,490
As a fraction of 10031,662,487,525,249/100
Read another way
As seconds1,003,323 years, 250 days and 5 hours
As bytes28.797 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 31,662,487,525,249
Nearby primes
Also reads as
31662487525249 (identifier)
- 14 characters
- Checksum valid
31662487525249 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). The check digit is valid for GTIN-14 (case/carton). 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-14 (case/carton)Check digit validGS1 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