Base | Representation |
---|---|
bin | 1010000000111111101011… |
… | …1010001100011010101001 |
3 | 1102222202102220022111000201 |
4 | 2200033322322030122221 |
5 | 2420411001422120412 |
6 | 35230534554032201 |
7 | 2214414563562136 |
oct | 240177272143251 |
9 | 42882386274021 |
10 | 11012210738857 |
11 | 3566285968829 |
12 | 129a2a7118661 |
13 | 61b5a7132b13 |
14 | 2a0dcb16d58d |
15 | 1416bd6a5e57 |
hex | a03fae8c6a9 |
11012210738857 has 2 divisors, whose sum is σ = 11012210738858. Its totient is φ = 11012210738856.
The previous prime is 11012210738833. The next prime is 11012210738869. The reversal of 11012210738857 is 75883701221011.
11012210738857 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., 9299944275561 + 1712266463296 = 3049581^2 + 1308536^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012210738857 - 215 = 11012210706089 is a prime.
It is not a weakly prime, because it can be changed into another prime (11012210738257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506105369428 + 5506105369429.
It is an arithmetic number, because the mean of its divisors is an integer number (5506105369429).
Almost surely, 211012210738857 is an apocalyptic number.
It is an amenable number.
11012210738857 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012210738857 is an equidigital number, since it uses as much as digits as its factorization.
11012210738857 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 188160, while the sum is 46.
Adding to 11012210738857 its reverse (75883701221011), we get a palindrome (86895911959868).
The spelling of 11012210738857 in words is "eleven trillion, twelve billion, two hundred ten million, seven hundred thirty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •