Recognised as Number

13,383,407,576,579,000

Positive
Even
Composite
17 digits

13,383,407,576,579,000 is an even 17-digit integer and a composite number. It has 32 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value13,383,407,576,579,000

Digit count17

Digit sum68

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 factorisation2^3 × 5^3 × 13,383,407,576,579

Distinct prime factors32, 5, 13,383,407,576,579

Number of divisors32

Sum of divisors σ(n)31,317,173,729,197,200

Aliquot sum17,933,766,152,618,200sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)5,353,363,030,631,200integers below n that share no factor with it

Carmichael function λ(n)669,170,378,828,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,353,363,030,631,200

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1,000, 13,383,407,576,579, 26,766,815,153,158, 53,533,630,306,316, 66,917,037,882,895, 107,067,260,612,632, 133,834,075,765,790, 267,668,151,531,580, 334,585,189,414,475, 535,336,303,063,160, 669,170,378,828,950, 1,338,340,757,657,900, 1,672,925,947,072,375, 2,676,681,515,315,800, 3,345,851,894,144,750, 6,691,703,788,289,500, 13,383,407,576,579,00032 in total

Arithmetic

Previous number13,383,407,576,578,999

Next number13,383,407,576,579,001

Double26,766,815,153,158,000

Square179,115,598,360,832,181,749,343,241,000,000

Cube2,397,177,056,185,842,534,339,691,097,856,663,552,539,000,000,000

Square root115,686,678≈irrational, shown to 9 decimal places

Cube root237,422≈

Negation-13,383,407,576,579,000

Representations

Decimal13,383,407,576,579,000

Binary10111110001100001000110110011001111100011110111011100054 bits

Octal574302154637075670

Hexadecimal2F8C23667C7BB8

Base 363NS0SK9R1YW

In wordsthirteen quadrillion, three hundred and eighty-three trillion, four hundred and seven billion, five hundred and seventy-six million, five hundred and seventy-nine thousand

Ordinalthirteen quadrillion, three hundred and eighty-three trillion, four hundred and seven billion, five hundred and seventy-six million, five hundred and seventy-nine thousandth

Engineering notation13.383408 × 10^15

In other bases

Ternary2102000001201021021010101010111112base 3; the most digit-efficient integer base after e: 34 digits

Quinary103013142222204101012000base 5; one hand: 24 digits

Septenary11135002201026656612base 7: 20 digits

Nonary72001637233333445base 9; each digit is two ternary digits: 17 digits

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

Vigesimal356j9737dc7a0base 20; hands and feet, and the Mayan and Yoruba systems: 13 digits

Sexagesimal1:19:40:52:52:17:41:56:23:20base 60; Babylonian, and still how an hour and a circle are divided: 10 digits

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

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

Bit-level

0000000000101111100011000010001101100110011111000111101110111000

Bit length54 bitsto write the magnitude

Set bits30the population count, or Hamming weight

Zero bits24within that length

Bit parityeven30 set bits, so even; not the same as the number itself being even

Highest set bitbit 53worth 9,007,199,254,740,992

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes72f 8c 23 66 7c 7b b8

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

At each machine width

64-bit0000000000101111100011000010001101100110011111000111101110111000

One's complement1111111111010000011100111101110010011001100000111000010001000111at 64 bits, every bit flipped

Bits reversed0001110111011110001111100110011011000100001100011111010000000000at 64 bits

Rotated left by 10000000001011111000110000100011011001100111110001111011101110000at 64 bits, wrapping

Shifted left by 11011111000110000100011011001100111110001111011101110000= 26,766,815,153,158,000, no wrap

Shifted right by 110111110001100001000110110011001111100011110111011100= 6,691,703,788,289,500, discarding the low bit

These bits as a double8.7744161 × 10^-308≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)

Nearest landmarks

Next prime13,383,407,576,579,063+63

Previous prime13,383,407,576,578,997−3

Distance to nearest prime3

Nearest square below13,383,407,466,675,684

Nearest square above13,383,407,698,049,041

Powers & multiples

13,383,407,576,579,000 to the power 2179,115,598,360,832,181,749,343,241,000,000

13,383,407,576,579,000 to the power 3239717705618584253433969109785… (49 digits)

13,383,407,576,579,000 to the power 4320823975761589481535564648239… (65 digits)

13,383,407,576,579,000 to the power 5429371802795585411895094833649… (81 digits)

First ten multiples13,383,407,576,579,000, 26,766,815,153,158,000, 40,150,222,729,737,000, 53,533,630,306,316,000, 66,917,037,882,895,000, 80,300,445,459,474,000, 93,683,853,036,053,000, 107,067,260,612,632,000, 120,450,668,189,211,000, 133,834,075,765,790,000

Powers of twoBetween 2^53 (9,007,199,254,740,992) and 2^54 (18,014,398,509,481,984)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 4

Divisible by 12No, remainder 8

Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1483the total stopping time

Highest value reached13,383,407,576,579,000

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

First steps13,383,407,576,579,000 → 6,691,703,788,289,500 → 3,345,851,894,144,750 → 1,672,925,947,072,375 → 5,018,777,841,217,126 → 2,509,388,920,608,563 → 7,528,166,761,825,690 → 3,764,083,380,912,845 → 11,292,250,142,738,536 → 5,646,125,071,369,268 → …

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

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.