Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1011110001111011011001 |
3 | 1022202120011212102220010211 |
4 | 2102332132023301323121 |
5 | 2310440022213013423 |
6 | 33251533151011121 |
7 | 2061465303330214 |
oct | 222763613617331 |
9 | 38676155386124 |
10 | 10100122001113 |
11 | 324448a618391 |
12 | 117157a509aa1 |
13 | 58358c012971 |
14 | 26cbc446a77b |
15 | 127ad9c2b10d |
hex | 92f9e2f1ed9 |
10100122001113 has 2 divisors, whose sum is σ = 10100122001114. Its totient is φ = 10100122001112.
The previous prime is 10100122001089. The next prime is 10100122001159. The reversal of 10100122001113 is 31110022100101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5259536783424 + 4840585217689 = 2293368^2 + 2200133^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100122001113 - 225 = 10100088446681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10100122001093 and 10100122001102.
It is not a weakly prime, because it can be changed into another prime (10100122001713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050061000556 + 5050061000557.
It is an arithmetic number, because the mean of its divisors is an integer number (5050061000557).
Almost surely, 210100122001113 is an apocalyptic number.
It is an amenable number.
10100122001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100122001113 is an equidigital number, since it uses as much as digits as its factorization.
10100122001113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10100122001113 its reverse (31110022100101), we get a palindrome (41210144101214).
The spelling of 10100122001113 in words is "ten trillion, one hundred billion, one hundred twenty-two million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •