Base | Representation |
---|---|
bin | 1001000111111000011011… |
… | …1010111000110001101101 |
3 | 1022111221210111012021000121 |
4 | 2101332012322320301231 |
5 | 2303322003112020023 |
6 | 33200103340324541 |
7 | 2053500556021021 |
oct | 221760672706155 |
9 | 38457714167017 |
10 | 10031012220013 |
11 | 3218145987a14 |
12 | 11600b1843751 |
13 | 579bc7148975 |
14 | 269709b86381 |
15 | 125de2863d5d |
hex | 91f86eb8c6d |
10031012220013 has 2 divisors, whose sum is σ = 10031012220014. Its totient is φ = 10031012220012.
The previous prime is 10031012219993. The next prime is 10031012220029. The reversal of 10031012220013 is 31002221013001.
It is an a-pointer prime, because the next prime (10031012220029) can be obtained adding 10031012220013 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9262447904329 + 768564315684 = 3043427^2 + 876678^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10031012220013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10031012220113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5015506110006 + 5015506110007.
It is an arithmetic number, because the mean of its divisors is an integer number (5015506110007).
Almost surely, 210031012220013 is an apocalyptic number.
It is an amenable number.
10031012220013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10031012220013 is an equidigital number, since it uses as much as digits as its factorization.
10031012220013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10031012220013 its reverse (31002221013001), we get a palindrome (41033233233014).
The spelling of 10031012220013 in words is "ten trillion, thirty-one billion, twelve million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •