Recognised as Number
19,992,980,164,221
- Positive
- Odd
- Composite
- Perfect cube
- 14 digits
19,992,980,164,221 is an odd 14-digit integer and a composite number. It has 64 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value19,992,980,164,221
Digit count14
Digit sum63
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, 27,141³
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 83^3 × 109^3
Distinct prime factors33, 83, 109
Number of divisors64
Sum of divisors σ(n)30,258,035,808,000
Aliquot sum10,265,055,643,779sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)13,047,259,300,272integers below n that share no factor with it
Carmichael function λ(n)362,423,869,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,047,259,300,272
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 83, 109, 249, 327, 747, 981, 2,241, 2,943, 6,889, 9,047, 11,881, 20,667, 27,141, 35,643, 62,001, 81,423, 106,929, 186,003, 244,269, 320,787, 571,787, 750,901, 986,123, 1,295,029, 1,715,361, 2,252,703, 2,958,369, 3,885,087, 5,146,083, 6,758,109, 8,875,107, 11,655,261, 15,438,249, 20,274,327, 26,625,321, 34,965,783, 62,324,783, 81,848,209, 107,487,407, 186,974,349, 245,544,627, 322,462,221, 560,923,047, 736,633,881, 967,386,663, 1,682,769,141, 2,209,901,643, 2,902,159,989, 6,793,401,347, 8,921,454,781, 20,380,204,041, 26,764,364,343, 61,140,612,123, 80,293,093,029, 183,421,836,369, 240,879,279,087, 740,480,746,823, 2,221,442,240,469, 6,664,326,721,407, 19,992,980,164,22164 in total
Arithmetic
Previous number19,992,980,164,220
Next number19,992,980,164,222
Double39,985,960,328,442
Square399,719,255,846,934,364,128,536,841
Cube7,991,579,153,404,937,717,773,962,702,928,628,565,861
Square root4,471,351.04461962≈irrational, shown to 9 decimal places
Cube root27,141
Negation-19,992,980,164,221
Reciprocal5.00175558 × 10^-14≈
Representations
Decimal19,992,980,164,221
Binary10010001011101111101001111011000011100111110145 bits
Octal442737236607175
Hexadecimal122EFA7B0E7D
Base 36734NC6PH9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen trillion, nine hundred and ninety-two billion, nine hundred and eighty million, one hundred and sixty-four thousand, two hundred and twenty-one
Ordinalnineteen trillion, nine hundred and ninety-two billion, nine hundred and eighty million, one hundred and sixty-four thousand, two hundred and twenty-first
Scientific notation1.99929802 × 10^13
Engineering notation19.99298 × 10^12
In other bases
Ternary2121210022101011101220022000base 3; the most digit-efficient integer base after e: 28 digits
Quinary10110031110410223341base 5; one hand: 20 digits
Septenary4132305454266231base 7: 16 digits
Nonary77708334356260base 9; each digit is two ternary digits: 14 digits
Duodecimal22aa934731139base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal1j0ja660ab1base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal7:8:31:8:13:21:10:21base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary10T0TT1010T10101111T0T010T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100111001100001111100011110001001110001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000100100010111011111010011110110000111001111101
Bit length45 bitsto write the magnitude
Set bits27the population count, or Hamming weight
Zero bits18within that length
Bit parityodd27 set bits, so odd; 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
Bytes612 2e fa 7b 0e 7d
Gray code110110011100110000111010001101000100101000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000100100010111011111010011110110000111001111101
One's complement1111111111111111111011011101000100000101100001001111000110000010at 64 bits, every bit flipped
Bits reversed1011111001110000110111100101111101110100010010000000000000000000at 64 bits
Rotated left by 10000000000000000001001000101110111110100111101100001110011111010at 64 bits, wrapping
Shifted left by 11001000101110111110100111101100001110011111010= 39,985,960,328,442, no wrap
Shifted right by 110010001011101111101001111011000011100111110= 9,996,490,082,110, discarding the low bit
These bits as a double9.87784466 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime10
Nearest square below19,992,979,765,201
Nearest square above19,992,988,707,904
Powers & multiples
19,992,980,164,221 to the power 2399,719,255,846,934,364,128,536,841
19,992,980,164,221 to the power 37,991,579,153,404,937,717,773,962,702,928,628,565,861
19,992,980,164,221 to the power 4159775483494826971844012757790… (54 digits)
19,992,980,164,221 to the power 5319438807224089542654189032945… (67 digits)
First ten multiples19,992,980,164,221, 39,985,960,328,442, 59,978,940,492,663, 79,971,920,656,884, 99,964,900,821,105, 119,957,880,985,326, 139,950,861,149,547, 159,943,841,313,768, 179,936,821,477,989, 199,929,801,642,210
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 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1365the total stopping time
Highest value reached85,399,702,381,1684× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,992,980,164,221 → 59,978,940,492,664 → 29,989,470,246,332 → 14,994,735,123,166 → 7,497,367,561,583 → 22,492,102,684,750 → 11,246,051,342,375 → 33,738,154,027,126 → 16,869,077,013,563 → 50,607,231,040,690 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.99929802 × 10^15%
19,992,980,164,221% as a decimal199,929,801,642.21
19,992,980,164,221% of 10019,992,980,164,221
19,992,980,164,221% of 1,000199,929,801,642,210
As a fraction of 10019,992,980,164,221/100
Read another way
As seconds633,539 years, 113 days and 15 hours
As bytes18.184 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 19,992,980,164,221
Nearby primes
Also reads as
19992980164221 (identifier)
- 14 characters
- Checksum fails
19992980164221 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). 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-14 (case/carton)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