Base | Representation |
---|---|
bin | 1001000110101010100110… |
… | …1101110010001000100101 |
3 | 1022102221212112221222220022 |
4 | 2101222221231302020211 |
5 | 2303001212003313023 |
6 | 33142330340244525 |
7 | 2052131063613224 |
oct | 221525155621045 |
9 | 38387775858808 |
10 | 10010121151013 |
11 | 320a2a5476635 |
12 | 11580413a0745 |
13 | 577c47c83789 |
14 | 2686c73cacbb |
15 | 1255bd7827c8 |
hex | 91aa9b72225 |
10010121151013 has 2 divisors, whose sum is σ = 10010121151014. Its totient is φ = 10010121151012.
The previous prime is 10010121151001. The next prime is 10010121151057. The reversal of 10010121151013 is 31015112101001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8786048872129 + 1224072278884 = 2964127^2 + 1106378^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010121151013 - 26 = 10010121150949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10010121150982 and 10010121151000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010121171013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005060575506 + 5005060575507.
It is an arithmetic number, because the mean of its divisors is an integer number (5005060575507).
Almost surely, 210010121151013 is an apocalyptic number.
It is an amenable number.
10010121151013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010121151013 is an equidigital number, since it uses as much as digits as its factorization.
10010121151013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 10010121151013 its reverse (31015112101001), we get a palindrome (41025233252014).
The spelling of 10010121151013 in words is "ten trillion, ten billion, one hundred twenty-one million, one hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •