Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …0011011101110011110101 |
3 | 1022121100112221102001212021 |
4 | 2102111132103131303311 |
5 | 2304224343223213302 |
6 | 33215413035353141 |
7 | 2055346355523106 |
oct | 222253623356365 |
9 | 38540487361767 |
10 | 10056100601077 |
11 | 322784a699a43 |
12 | 1164b338b27b1 |
13 | 57c394a8826b |
14 | 26aa09b783ad |
15 | 1268b0193437 |
hex | 9255e4ddcf5 |
10056100601077 has 2 divisors, whose sum is σ = 10056100601078. Its totient is φ = 10056100601076.
The previous prime is 10056100601023. The next prime is 10056100601087. The reversal of 10056100601077 is 77010600165001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8969150481316 + 1086950119761 = 2994854^2 + 1042569^2 .
It is a cyclic number.
It is not a de Polignac number, because 10056100601077 - 211 = 10056100599029 is a prime.
It is a super-2 number, since 2×100561006010772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10056100601087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5028050300538 + 5028050300539.
It is an arithmetic number, because the mean of its divisors is an integer number (5028050300539).
Almost surely, 210056100601077 is an apocalyptic number.
It is an amenable number.
10056100601077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10056100601077 is an equidigital number, since it uses as much as digits as its factorization.
10056100601077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8820, while the sum is 34.
Adding to 10056100601077 its reverse (77010600165001), we get a palindrome (87066700766078).
The spelling of 10056100601077 in words is "ten trillion, fifty-six billion, one hundred million, six hundred one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •