Recognised as Number
13,032,107,220,001
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
13,032,107,220,001 is an odd 14-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 value13,032,107,220,001
Digit count14
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,610,001²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17^2 × 212,353^2
Distinct prime factors217, 212,353
Number of divisors9
Sum of divisors σ(n)13,843,860,751,641
Aliquot sum811,753,531,640sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,265,454,917,632integers below n that share no factor with it
Carmichael function λ(n)766,590,932,352the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,265,454,917,632
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 17, 289, 212,353, 3,610,001, 61,370,017, 45,093,796,609, 766,594,542,353, 13,032,107,220,0019 in total
Arithmetic
Previous number13,032,107,220,000
Next number13,032,107,220,002
Double26,064,214,440,002
Square169,835,818,593,602,192,614,440,001
Cube2,213,318,597,708,463,215,997,067,815,481,521,660,001
Square root3,610,001exact
Cube root23,532.688608806≈
Negation-13,032,107,220,001
Reciprocal7.67335614 × 10^-14≈
Representations
Decimal13,032,107,220,001
Binary1011110110100100011000011111000111000010000144 bits
Octal275510607616041
HexadecimalBDA461F1C21
Base 364MAV85R1D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen trillion, thirty-two billion, one hundred and seven million, two hundred and twenty thousand and one
Ordinalthirteen trillion, thirty-two billion, one hundred and seven million, two hundred and twenty thousand and first
Scientific notation1.30321072 × 10^13
Engineering notation13.032107 × 10^12
In other bases
Ternary1201010212010221220022001211base 3; the most digit-efficient integer base after e: 28 digits
Quinary3202004223422020001base 5; one hand: 19 digits
Septenary2513352523434652base 7: 16 digits
Nonary51125127808054base 9; each digit is two ternary digits: 14 digits
Duodecimal156586240b341base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal15916da2a01base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:39:19:23:49:43:20:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT010110TT01100T0T010T01TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000010111001011010011000110110110001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010111101101001000110000111110001110000100001
Bit length44 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits23within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes60b da 46 1f 1c 21
Gray code11100011011101100101000100001001001000110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010111101101001000110000111110001110000100001
One's complement1111111111111111111101000010010110111001111000001110001111011110at 64 bits, every bit flipped
Bits reversed1000010000111000111110000110001001011011110100000000000000000000at 64 bits
Rotated left by 10000000000000000000101111011010010001100001111100011100001000010at 64 bits, wrapping
Shifted left by 1101111011010010001100001111100011100001000010= 26,064,214,440,002, no wrap
Shifted right by 11011110110100100011000011111000111000010000= 6,516,053,610,000, discarding the low bit
These bits as a double6.43871647 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime16
Nearest square below13,032,107,220,001
Nearest square above13,032,114,440,004
Powers & multiples
13,032,107,220,001 to the power 2169,835,818,593,602,192,614,440,001
13,032,107,220,001 to the power 32,213,318,597,708,463,215,997,067,815,481,521,660,001
13,032,107,220,001 to the power 4288442052773589522508975154401… (53 digits)
13,032,107,220,001 to the power 5375900775850260548365834121400… (66 digits)
First ten multiples13,032,107,220,001, 26,064,214,440,002, 39,096,321,660,003, 52,128,428,880,004, 65,160,536,100,005, 78,192,643,320,006, 91,224,750,540,007, 104,256,857,760,008, 117,288,964,980,009, 130,321,072,200,010
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1279the total stopping time
Highest value reached46,968,560,744,2723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,032,107,220,001 → 39,096,321,660,004 → 19,548,160,830,002 → 9,774,080,415,001 → 29,322,241,245,004 → 14,661,120,622,502 → 7,330,560,311,251 → 21,991,680,933,754 → 10,995,840,466,877 → 32,987,521,400,632 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.30321072 × 10^15%
13,032,107,220,001% as a decimal130,321,072,200.01
13,032,107,220,001% of 10013,032,107,220,001
13,032,107,220,001% of 1,000130,321,072,200,010
As a fraction of 10013,032,107,220,001/100
Read another way
As seconds412,962 years, 203 days and 19 hours
As bytes11.853 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 13,032,107,220,001
Nearby primes
Also reads as
13032107220001 (identifier)
- 14 characters
- Checksum fails
13032107220001 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