Recognised as Number

13,013,038,954,823

Positive
Odd
Prime
14 digits

13,013,038,954,823 is an odd 14-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value13,013,038,954,823

Digit count14

Digit sum50

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13,013,038,954,823

Distinct prime factors113,013,038,954,823

Number of divisors2

Sum of divisors σ(n)13,013,038,954,824

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)13,013,038,954,822integers below n that share no factor with it

Carmichael function λ(n)13,013,038,954,822the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 13,013,038,954,8232 in total

Arithmetic

Previous number13,013,038,954,822

Next number13,013,038,954,824

Double26,026,077,909,646

Half6,506,519,477,411.5

Square169,339,182,839,740,876,234,961,329

Cube2,203,617,382,871,442,509,188,751,372,101,983,039,767

Square root3,607,358.99999196≈irrational, shown to 9 decimal places

Cube root23,521.205518798≈

Negation-13,013,038,954,823

Reciprocal7.68460007 × 10^-14≈

Representations

Decimal13,013,038,954,823

Binary1011110101011101010110010000011110010100011144 bits

Octal275272544074507

HexadecimalBD5D5907947

Base 364M23VENGN

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 twenty-three

Ordinalthirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and twenty-third

Scientific notation1.3013039 × 10^13

Engineering notation13.013039 × 10^12

In other bases

Ternary1201002000221001121001201012base 3; the most digit-efficient integer base after e: 28 digits

Quinary3201201200433023243base 5; one hand: 19 digits

Septenary2512106144032055base 7: 16 digits

Nonary51060831531635base 9; each digit is two ternary digits: 14 digits

Duodecimal15620204bb71bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits

Vigesimal15868ed9713base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits

Sexagesimal4:38:54:52:30:43:0:23base 60; Babylonian, and still how an hour and a circle are divided: 8 digits

Balanced ternary1TT0101T0010T101TTT101TT011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111000010101000101010100100011000100101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000010111101010111010101100100000111100101000111

Bit length44 bitsto write the magnitude

Set bits24the population count, or Hamming weight

Zero bits20within that length

Bit parityeven24 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 47

Gray code11100011111100111111010110000100010111100100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000010111101010111010101100100000111100101000111

One's complement1111111111111111111101000010101000101010011011111000011010111000at 64 bits, every bit flipped

Bits reversed1110001010011110000010011010101110101011110100000000000000000000at 64 bits

Rotated left by 10000000000000000000101111010101110101011001000001111001010001110at 64 bits, wrapping

Shifted left by 1101111010101110101011001000001111001010001110= 26,026,077,909,646, no wrap

Shifted right by 11011110101011101010110010000011110010100011= 6,506,519,477,411, discarding the low bit

These bits as a double6.4292955 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,013,038,955,099+276

Previous prime13,013,038,954,819−4

Distance to nearest prime0, it is prime

Nearest square below13,013,031,740,164

Nearest square above13,013,038,954,881

Powers & multiples

13,013,038,954,823 to the power 2169,339,182,839,740,876,234,961,329

13,013,038,954,823 to the power 32,203,617,382,871,442,509,188,751,372,101,983,039,767

13,013,038,954,823 to the power 4286757588448311908523479217288… (53 digits)

13,013,038,954,823 to the power 5373158766906898477645108037889… (66 digits)

First ten multiples13,013,038,954,823, 26,026,077,909,646, 39,039,116,864,469, 52,052,155,819,292, 65,065,194,774,115, 78,078,233,728,938, 91,091,272,683,761, 104,104,311,638,584, 117,117,350,593,407, 130,130,389,548,230

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 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 6

Divisible by 12No, remainder 11

Divisible by 100No, remainder 23

Collatz (3n + 1) trajectory

Steps to reach 1292the total stopping time

Highest value reached562,798,049,738,84843× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps13,013,038,954,823 → 39,039,116,864,470 → 19,519,558,432,235 → 58,558,675,296,706 → 29,279,337,648,353 → 87,838,012,945,060 → 43,919,006,472,530 → 21,959,503,236,265 → 65,878,509,708,796 → 32,939,254,854,398 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1.3013039 × 10^15%

13,013,038,954,823% as a decimal130,130,389,548.23

13,013,038,954,823% of 10013,013,038,954,823

13,013,038,954,823% of 1,000130,130,389,548,230

As a fraction of 10013,013,038,954,823/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,823

Nearby primes

13013038954823 (identifier)

14 characters
Checksum fails

13013038954823 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.

Open this reading on its own page →

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