Recognised as Number
9,957,344,336,677
- Positive
- Odd
- Composite
- 13 digits
9,957,344,336,677 is an odd 13-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,957,344,336,677
Digit count13
Digit sum73
Digit product2,160,406,080
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation12,917 × 770,871,281
Distinct prime factors212,917, 770,871,281
Number of divisors4
Sum of divisors σ(n)9,958,115,220,876
Aliquot sum770,884,199sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,956,573,452,480integers below n that share no factor with it
Carmichael function λ(n)2,489,143,363,120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,956,573,452,480
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 12,917, 770,871,281, 9,957,344,336,6774 in total
Arithmetic
Previous number9,957,344,336,676
Next number9,957,344,336,678
Double19,914,688,673,354
Square99,148,706,239,153,525,127,402,329
Cube987,257,808,559,286,888,985,680,195,572,609,920,733
Square root3,155,526.00000016≈irrational, shown to 9 decimal places
Cube root21,513.670294256≈
Negation-9,957,344,336,677
Reciprocal1.00428384 × 10^-13≈
Representations
Decimal9,957,344,336,677
Binary1001000011100101111111111000110110110010010144 bits
Octal220713776155445
Hexadecimal90E5FF8DB25
Base 363J2C9Q691
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine trillion, nine hundred and fifty-seven billion, three hundred and forty-four million, three hundred and thirty-six thousand, six hundred and seventy-seven
Ordinalnine trillion, nine hundred and fifty-seven billion, three hundred and forty-four million, three hundred and thirty-six thousand, six hundred and seventy-seventh
Scientific notation9.95734434 × 10^12
Engineering notation9.957344 × 10^12
In other bases
Ternary1022020220122110002001010001base 3; the most digit-efficient integer base after e: 28 digits
Quinary2301120120122233202base 5; one hand: 19 digits
Septenary2045252163236653base 7: 16 digits
Nonary38226573061101base 9; each digit is two ternary digits: 14 digits
Duodecimal114997257a831base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimalj8j3a221dhbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal3:33:25:13:36:22:24:37base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary110T1T10T1T0T11001T001010001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110010001001110100000000010010010111101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010010000111001011111111110001101101100100101
Bit length44 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits19within that length
Bit parityodd25 set bits, so odd; 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
Bytes609 0e 5f f8 db 25
Gray code11011000100101110000000001001011011010110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010010000111001011111111110001101101100100101
One's complement1111111111111111111101101111000110100000000001110010010011011010at 64 bits, every bit flipped
Bits reversed1010010011011011000111111111101001110000100100000000000000000000at 64 bits
Rotated left by 10000000000000000000100100001110010111111111100011011011001001010at 64 bits, wrapping
Shifted left by 1100100001110010111111111100011011011001001010= 19,914,688,673,354, no wrap
Shifted right by 11001000011100101111111111000110110110010010= 4,978,672,168,338, discarding the low bit
These bits as a double4.91958176 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime6
Nearest square below9,957,344,336,676
Nearest square above9,957,350,647,729
Powers & multiples
9,957,344,336,677 to the power 299,148,706,239,153,525,127,402,329
9,957,344,336,677 to the power 3987,257,808,559,286,888,985,680,195,572,609,920,733
9,957,344,336,677 to the power 4983046594889796116063526070433… (52 digits)
9,957,344,336,677 to the power 5978853344431552044522034190419… (65 digits)
First ten multiples9,957,344,336,677, 19,914,688,673,354, 29,872,033,010,031, 39,829,377,346,708, 49,786,721,683,385, 59,744,066,020,062, 69,701,410,356,739, 79,658,754,693,416, 89,616,099,030,093, 99,573,443,366,770
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1470the total stopping time
Highest value reached29,872,033,010,0323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,957,344,336,677 → 29,872,033,010,032 → 14,936,016,505,016 → 7,468,008,252,508 → 3,734,004,126,254 → 1,867,002,063,127 → 5,601,006,189,382 → 2,800,503,094,691 → 8,401,509,284,074 → 4,200,754,642,037 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage995,734,433,667,700%
9,957,344,336,677% as a decimal99,573,443,366.77
9,957,344,336,677% of 1009,957,344,336,677
9,957,344,336,677% of 1,00099,573,443,366,770
As a fraction of 1009,957,344,336,677/100
Read another way
As seconds315,529 years, 73 days and 16 hours
As bytes9.056 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 9,957,344,336,677
Nearby primes
Also reads as
9957344336677 (identifier)
- 13 characters
- Checksum fails
9957344336677 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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