Nerdulator> put something in

Recognised as Number

13,383,407,576,579,063

  • Positive
  • Odd
  • Prime
  • 17 digits

13,383,407,576,579,063 is an odd 17-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Digit count17
Digit sum77
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,383,407,576,579,063
Distinct prime factors113,383,407,576,579,063
Number of divisors2
Sum of divisors σ(n)13,383,407,576,579,064
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)13,383,407,576,579,062integers below n that share no factor with it
Carmichael function λ(n)13,383,407,576,579,062the 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,383,407,576,579,0632 in total

Arithmetic

Previous number13,383,407,576,579,062
Square179,115,598,360,833,868,058,697,889,957,969
Cube2,397,177,056,185,876,387,187,781,295,298,370,412,425,875,403,047
Square root115,686,678≈irrational, shown to 9 decimal places
Cube root237,422≈

Representations

Decimal13,383,407,576,579,063
Binary10111110001100001000110110011001111100011110111111011154 bits
Octal574302154637075767
Hexadecimal2F8C23667C7BF7
Base 363NS0SK9R20N
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 and sixty-three
Ordinalthirteen quadrillion, three hundred and eighty-three trillion, four hundred and seven billion, five hundred and seventy-six million, five hundred and seventy-nine thousand and sixty-third
Engineering notation13.383408 × 10^15

In other bases

Ternary2102000001201021021010101010120212base 3; the most digit-efficient integer base after e: 34 digits
Quinary103013142222204101012223base 5; one hand: 24 digits
Septenary11135002201026660032base 7: 20 digits
Nonary72001637233333525base 9; each digit is two ternary digits: 17 digits
Duodecimala5105607259a61bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 15 digits
Vigesimal356j9737dc7d3base 20; hands and feet, and the Mayan and Yoruba systems: 13 digits
Sexagesimal1:19:40:52:52:17:41:56:24:23base 60; Babylonian, and still how an hour and a circle are divided: 10 digits
Balanced ternary1T11T00001TT011T11T1010101011TT10TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110000100111000110010010111011100011011000110000001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000101111100011000010001101100110011111000111101111110111
Bit length54 bitsto write the magnitude
Set bits33the population count, or Hamming weight
Zero bits21within that length
Bit parityodd33 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 53worth 9,007,199,254,740,992
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes72f 8c 23 66 7c 7b f7
Gray code111000010010100011001011010101010000100100011000001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000101111100011000010001101100110011111000111101111110111
One's complement1111111111010000011100111101110010011001100000111000010000001000at 64 bits, every bit flipped
Bits reversed1110111111011110001111100110011011000100001100011111010000000000at 64 bits
Rotated left by 10000000001011111000110000100011011001100111110001111011111101110at 64 bits, wrapping
Shifted left by 11011111000110000100011011001100111110001111011111101110= 26,766,815,153,158,126, no wrap
Shifted right by 110111110001100001000110110011001111100011110111111011= 6,691,703,788,289,531, discarding the low bit
These bits as a double8.7744161 × 10^-308≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)

Nearest landmarks

Previous prime13,383,407,576,578,997−66
Distance to nearest prime0, it is prime
Nearest square below13,383,407,466,675,684
Nearest square above13,383,407,698,049,041

Powers & multiples

13,383,407,576,579,063 to the power 2179,115,598,360,833,868,058,697,889,957,969
13,383,407,576,579,063 to the power 3239717705618587638718778129529… (49 digits)
13,383,407,576,579,063 to the power 4320823975761595522421746236605… (65 digits)
13,383,407,576,579,063 to the power 5429371802795595517850331323813… (81 digits)
First ten multiples13,383,407,576,579,063, 26,766,815,153,158,126, 40,150,222,729,737,189, 53,533,630,306,316,252, 66,917,037,882,895,315, 80,300,445,459,474,378, 93,683,853,036,053,441, 107,067,260,612,632,504, 120,450,668,189,211,567, 133,834,075,765,790,630
Powers of twoBetween 2^53 (9,007,199,254,740,992) and 2^54 (18,014,398,509,481,984)

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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 1470the total stopping time
Highest value reached90,338,001,141,908,6806× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps13,383,407,576,579,063 → 40,150,222,729,737,190 → 20,075,111,364,868,595 → 60,225,334,094,605,786 → 30,112,667,047,302,893 → 90,338,001,141,908,680 → 45,169,000,570,954,340 → 22,584,500,285,477,170 → 11,292,250,142,738,585 → 33,876,750,428,215,756 → …
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.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “13383407576579063” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.