Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …101100010001110000000001 |
3 | 111010002222011012221201010212 |
4 | 112233112212230101300001 |
5 | 101102040223142043012 |
6 | 552412245243003505 |
7 | 30031364353425131 |
oct | 2657264654216001 |
9 | 433088135851125 |
10 | 100011110112257 |
11 | 29959523412a33 |
12 | b2729a6509595 |
13 | 43a6012b14a76 |
14 | 1a9a7c6586ac1 |
15 | b867b9d5eb22 |
hex | 5af5a6b11c01 |
100011110112257 has 2 divisors, whose sum is σ = 100011110112258. Its totient is φ = 100011110112256.
The previous prime is 100011110112163. The next prime is 100011110112271. The reversal of 100011110112257 is 752211011110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87597544734736 + 12413565377521 = 9359356^2 + 3523289^2 .
It is an emirp because it is prime and its reverse (752211011110001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100011110112257 - 216 = 100011110046721 is a prime.
It is not a weakly prime, because it can be changed into another prime (100011110102257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005555056128 + 50005555056129.
It is an arithmetic number, because the mean of its divisors is an integer number (50005555056129).
Almost surely, 2100011110112257 is an apocalyptic number.
It is an amenable number.
100011110112257 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011110112257 is an equidigital number, since it uses as much as digits as its factorization.
100011110112257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 140, while the sum is 23.
Adding to 100011110112257 its reverse (752211011110001), we get a palindrome (852222121222258).
The spelling of 100011110112257 in words is "one hundred trillion, eleven billion, one hundred ten million, one hundred twelve thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •