Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0011110101100111001101 |
3 | 1022110001101202212020022022 |
4 | 2101223210003311213031 |
5 | 2303010213100322312 |
6 | 33143011424455525 |
7 | 2052164251026263 |
oct | 221534403654715 |
9 | 38401352766268 |
10 | 10011100010957 |
11 | 320a757a705a1 |
12 | 115827517a5a5 |
13 | 5780729cb646 |
14 | 26877b3d4433 |
15 | 12562968a172 |
hex | 91ae40f59cd |
10011100010957 has 2 divisors, whose sum is σ = 10011100010958. Its totient is φ = 10011100010956.
The previous prime is 10011100010921. The next prime is 10011100010981. The reversal of 10011100010957 is 75901000111001.
10011100010957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7560140684041 + 2450959326916 = 2749571^2 + 1565554^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011100010957 - 216 = 10011099945421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011100010917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005550005478 + 5005550005479.
It is an arithmetic number, because the mean of its divisors is an integer number (5005550005479).
Almost surely, 210011100010957 is an apocalyptic number.
It is an amenable number.
10011100010957 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011100010957 is an equidigital number, since it uses as much as digits as its factorization.
10011100010957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 315, while the sum is 26.
Adding to 10011100010957 its reverse (75901000111001), we get a palindrome (85912100121958).
The spelling of 10011100010957 in words is "ten trillion, eleven billion, one hundred million, ten thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •