Base | Representation |
---|---|
bin | 11011000100011100101… |
… | …10001010010011111101 |
3 | 10021220202100022220110202 |
4 | 31202032112022103331 |
5 | 110214321341010023 |
6 | 1551141010413245 |
7 | 124124525663525 |
oct | 15421626122375 |
9 | 3256670286422 |
10 | 930101110013 |
11 | 3294a9913319 |
12 | 130314b91225 |
13 | 69928a92cca |
14 | 33035030685 |
15 | 192d9e79128 |
hex | d88e58a4fd |
930101110013 has 2 divisors, whose sum is σ = 930101110014. Its totient is φ = 930101110012.
The previous prime is 930101109997. The next prime is 930101110079. The reversal of 930101110013 is 310011101039.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 895252807684 + 34848302329 = 946178^2 + 186677^2 .
It is an emirp because it is prime and its reverse (310011101039) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 930101110013 - 24 = 930101109997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (930101116013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 465050555006 + 465050555007.
It is an arithmetic number, because the mean of its divisors is an integer number (465050555007).
Almost surely, 2930101110013 is an apocalyptic number.
It is an amenable number.
930101110013 is a deficient number, since it is larger than the sum of its proper divisors (1).
930101110013 is an equidigital number, since it uses as much as digits as its factorization.
930101110013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 20.
The spelling of 930101110013 in words is "nine hundred thirty billion, one hundred one million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •