Base | Representation |
---|---|
bin | 1011110110100000010000… |
… | …1000001001010010001111 |
3 | 1201010202021210111201100111 |
4 | 2331220010020021102033 |
5 | 3201444442001120421 |
6 | 43414205254340451 |
7 | 2513313220413643 |
oct | 275500410112217 |
9 | 51122253451314 |
10 | 13031000020111 |
11 | 4174463880727 |
12 | 15655b365a727 |
13 | 736a83296898 |
14 | 3309bd1c4c23 |
15 | 178e75e97ee1 |
hex | bda0420948f |
13031000020111 has 2 divisors, whose sum is σ = 13031000020112. Its totient is φ = 13031000020110.
The previous prime is 13031000020063. The next prime is 13031000020153. The reversal of 13031000020111 is 11102000013031.
It is a strong prime.
It is an emirp because it is prime and its reverse (11102000013031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13031000020111 - 219 = 13030999495823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13031000020091 and 13031000020100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13031000020411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515500010055 + 6515500010056.
It is an arithmetic number, because the mean of its divisors is an integer number (6515500010056).
Almost surely, 213031000020111 is an apocalyptic number.
13031000020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031000020111 is an equidigital number, since it uses as much as digits as its factorization.
13031000020111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13031000020111 its reverse (11102000013031), we get a palindrome (24133000033142).
The spelling of 13031000020111 in words is "thirteen trillion, thirty-one billion, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •