Recognised as Number
13,013,038,954,881
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
13,013,038,954,881 is an odd 14-digit integer and a composite number. It has 81 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value13,013,038,954,881
Digit count14
Digit sum54
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 squareYes, 3,607,359²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7^2 × 19^2 × 9,041^2
Distinct prime factors43, 7, 19, 9,041
Number of divisors81
Sum of divisors σ(n)23,079,381,226,083
Aliquot sum10,066,342,271,202sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,043,873,477,760integers below n that share no factor with it
Carmichael function λ(n)97,831,576,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,043,873,477,760
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 19, 21, 49, 57, 63, 133, 147, 171, 361, 399, 441, 931, 1,083, 1,197, 2,527, 2,793, 3,249, 7,581, 8,379, 9,041, 17,689, 22,743, 27,123, 53,067, 63,287, 81,369, 159,201, 171,779, 189,861, 443,009, 515,337, 569,583, 1,202,453, 1,329,027, 1,546,011, 3,263,801, 3,607,359, 3,987,081, 8,417,171, 9,791,403, 10,822,077, 22,846,607, 25,251,513, 29,374,209, 68,539,821, 75,754,539, 81,739,681, 159,926,249, 205,619,463, 245,219,043, 479,778,747, 572,177,767, 735,657,129, 1,439,336,241, 1,553,053,939, 1,716,533,301, 4,005,244,369, 4,659,161,817, 5,149,599,903, 10,871,377,573, 12,015,733,107, 13,977,485,451, 29,508,024,841, 32,614,132,719, 36,047,199,321, 76,099,643,011, 88,524,074,523, 97,842,398,157, 206,556,173,887, 228,298,929,033, 265,572,223,569, 619,668,521,661, 684,896,787,099, 1,445,893,217,209, 1,859,005,564,983, 4,337,679,651,627, 13,013,038,954,88181 in total
Arithmetic
Previous number13,013,038,954,880
Next number13,013,038,954,882
Double26,026,077,909,762
Square169,339,182,841,250,388,753,724,161
Cube2,203,617,382,900,907,527,002,997,612,155,998,579,841
Square root3,607,359exact
Cube root23,521.205518833≈
Negation-13,013,038,954,881
Reciprocal7.68460007 × 10^-14≈
Representations
Decimal13,013,038,954,881
Binary1011110101011101010110010000011110011000000144 bits
Octal275272544074601
HexadecimalBD5D5907981
Base 364M23VENI9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and eighty-one
Ordinalthirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and eighty-first
Scientific notation1.3013039 × 10^13
Engineering notation13.013039 × 10^12
In other bases
Ternary1201002000221001121001210100base 3; the most digit-efficient integer base after e: 28 digits
Quinary3201201200433024011base 5; one hand: 19 digits
Septenary2512106144032200base 7: 16 digits
Nonary51060831531710base 9; each digit is two ternary digits: 14 digits
Duodecimal15620204bb769base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal15868ed9741base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:38:54:52:30:43:1:21base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT0101T0010T101TTT101TT10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000010101000101010100100011000111010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010111101010111010101100100000111100110000001
Bit length44 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits22within that length
Bit parityeven22 set bits, so even; 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 d5 d5 90 79 81
Gray code11100011111100111111010110000100010101000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010111101010111010101100100000111100110000001
One's complement1111111111111111111101000010101000101010011011111000011001111110at 64 bits, every bit flipped
Bits reversed1000000110011110000010011010101110101011110100000000000000000000at 64 bits
Rotated left by 10000000000000000000101111010101110101011001000001111001100000010at 64 bits, wrapping
Shifted left by 1101111010101110101011001000001111001100000010= 26,026,077,909,762, no wrap
Shifted right by 11011110101011101010110010000011110011000000= 6,506,519,477,440, discarding the low bit
These bits as a double6.4292955 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime58
Nearest square below13,013,038,954,881
Nearest square above13,013,046,169,600
Powers & multiples
13,013,038,954,881 to the power 2169,339,182,841,250,388,753,724,161
13,013,038,954,881 to the power 32,203,617,382,900,907,527,002,997,612,155,998,579,841
13,013,038,954,881 to the power 4286757588453424300851775143330… (53 digits)
13,013,038,954,881 to the power 5373158766915214447710183212925… (66 digits)
First ten multiples13,013,038,954,881, 26,026,077,909,762, 39,039,116,864,643, 52,052,155,819,524, 65,065,194,774,405, 78,078,233,729,286, 91,091,272,684,167, 104,104,311,639,048, 117,117,350,593,929, 130,130,389,548,810
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 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1292the total stopping time
Highest value reached39,039,116,864,6443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,013,038,954,881 → 39,039,116,864,644 → 19,519,558,432,322 → 9,759,779,216,161 → 29,279,337,648,484 → 14,639,668,824,242 → 7,319,834,412,121 → 21,959,503,236,364 → 10,979,751,618,182 → 5,489,875,809,091 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.3013039 × 10^15%
13,013,038,954,881% as a decimal130,130,389,548.81
13,013,038,954,881% of 10013,013,038,954,881
13,013,038,954,881% of 1,000130,130,389,548,810
As a fraction of 10013,013,038,954,881/100
Read another way
As seconds412,358 years, 117 days and 7 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,038,954,881
Nearby primes
Also reads as
13013038954881 (identifier)
- 14 characters
- Checksum valid
13013038954881 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