Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …0110001111001111111101 |
3 | 1022102221120211001002122111 |
4 | 2101222203012033033331 |
5 | 2303001000042334323 |
6 | 33142311332414021 |
7 | 2052125245102204 |
oct | 221524306171775 |
9 | 38387524032574 |
10 | 10010010121213 |
11 | 320a248831273 |
12 | 1158010177311 |
13 | 577c2ac7a77b |
14 | 2686b676823b |
15 | 1255b3b4ec0d |
hex | 91aa318f3fd |
10010010121213 has 2 divisors, whose sum is σ = 10010010121214. Its totient is φ = 10010010121212.
The previous prime is 10010010121159. The next prime is 10010010121247. The reversal of 10010010121213 is 31212101001001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6796355148324 + 3213654972889 = 2606982^2 + 1792667^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010010121213 - 213 = 10010010113021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10010010121193 and 10010010121202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010010121253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005005060606 + 5005005060607.
It is an arithmetic number, because the mean of its divisors is an integer number (5005005060607).
Almost surely, 210010010121213 is an apocalyptic number.
It is an amenable number.
10010010121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010010121213 is an equidigital number, since it uses as much as digits as its factorization.
10010010121213 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 10010010121213 its reverse (31212101001001), we get a palindrome (41222111122214).
The spelling of 10010010121213 in words is "ten trillion, ten billion, ten million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •