Recognised as Number
13,013,031,740,164
- Positive
- Even
- Composite
- Perfect square
- 14 digits
13,013,031,740,164 is an even 14-digit integer and a composite number. It has 9 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value13,013,031,740,164
Digit count14
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,607,358²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 1,803,679^2
Distinct prime factors22, 1,803,679
Number of divisors9
Sum of divisors σ(n)22,772,818,171,047
Aliquot sum9,759,786,430,883sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,506,512,262,724integers below n that share no factor with it
Carmichael function λ(n)3,253,256,131,362the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,506,512,262,724
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 1,803,679, 3,607,358, 7,214,716, 3,253,257,935,041, 6,506,515,870,082, 13,013,031,740,1649 in total
Arithmetic
Previous number13,013,031,740,163
Next number13,013,031,740,165
Double26,026,063,480,328
Square169,338,995,070,515,702,010,746,896
Cube2,203,613,717,700,095,963,625,795,753,884,241,530,944
Square root3,607,358exact
Cube root23,521.20117194≈
Negation-13,013,031,740,164
Reciprocal7.68460433 × 10^-14≈
Representations
Decimal13,013,031,740,164
Binary1011110101011101010100100010011000110000010044 bits
Octal275272510461404
HexadecimalBD5D5226304
Base 364M23R40LG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen trillion, thirteen billion, thirty-one million, seven hundred and forty thousand, one hundred and sixty-four
Ordinalthirteen trillion, thirteen billion, thirty-one million, seven hundred and forty thousand, one hundred and sixty-fourth
Scientific notation1.30130317 × 10^13
Engineering notation13.013032 × 10^12
In other bases
Ternary1201002000220120000112001121base 3; the most digit-efficient integer base after e: 28 digits
Quinary3201201142111141124base 5; one hand: 19 digits
Septenary2512106025513061base 7: 16 digits
Nonary51060816015047base 9; each digit is two ternary digits: 14 digits
Duodecimal156201a000544base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal15868c87a84base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:38:54:51:57:18:56:4base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT0101T0010T1TT0001TTT01TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000010101011010101011001111010011100000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010111101010111010101001000100110001100000100
Bit length44 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits24within that length
Bit parityeven20 set bits, so even; not the same as the number itself being even
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes60b d5 d5 22 63 04
Gray code11100011111100111111101100110101001010000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010111101010111010101001000100110001100000100
One's complement1111111111111111111101000010101000101010110111011001110011111011at 64 bits, every bit flipped
Bits reversed0010000011000110010001001010101110101011110100000000000000000000at 64 bits
Rotated left by 10000000000000000000101111010101110101010010001001100011000001000at 64 bits, wrapping
Shifted left by 1101111010101110101010010001001100011000001000= 26,026,063,480,328, no wrap
Shifted right by 11011110101011101010100100010011000110000010= 6,506,515,870,082, discarding the low bit
These bits as a double6.42929193 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime3
Nearest square below13,013,031,740,164
Nearest square above13,013,038,954,881
Powers & multiples
13,013,031,740,164 to the power 2169,338,995,070,515,702,010,746,896
13,013,031,740,164 to the power 32,203,613,717,700,095,963,625,795,753,884,241,530,944
13,013,031,740,164 to the power 4286756952514921412254111813660… (53 digits)
13,013,031,740,164 to the power 5373157732478937330148082908828… (66 digits)
First ten multiples13,013,031,740,164, 26,026,063,480,328, 39,039,095,220,492, 52,052,126,960,656, 65,065,158,700,820, 78,078,190,440,984, 91,091,222,181,148, 104,104,253,921,312, 117,117,285,661,476, 130,130,317,401,640
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 1323the total stopping time
Highest value reached13,013,031,740,164
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,013,031,740,164 → 6,506,515,870,082 → 3,253,257,935,041 → 9,759,773,805,124 → 4,879,886,902,562 → 2,439,943,451,281 → 7,319,830,353,844 → 3,659,915,176,922 → 1,829,957,588,461 → 5,489,872,765,384 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.30130317 × 10^15%
13,013,031,740,164% as a decimal130,130,317,401.64
13,013,031,740,164% of 10013,013,031,740,164
13,013,031,740,164% of 1,000130,130,317,401,640
As a fraction of 10013,013,031,740,164/100
Read another way
As seconds412,358 years, 33 days and 18 hours
As bytes11.835 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,013,031,740,164
Nearby primes
Also reads as
13013031740164 (identifier)
- 14 characters
- Checksum fails
13013031740164 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