Base | Representation |
---|---|
bin | 10010101001010010… |
… | …01111001001111001 |
3 | 221211121122020200021 |
4 | 21110221033021321 |
5 | 131000031440323 |
6 | 4333141410441 |
7 | 503025600004 |
oct | 112451171171 |
9 | 27747566607 |
10 | 10010030713 |
11 | 4277446261 |
12 | 1b34409a21 |
13 | c36abccc7 |
14 | 6ad61453b |
15 | 3d8be005d |
hex | 254a4f279 |
10010030713 has 2 divisors, whose sum is σ = 10010030714. Its totient is φ = 10010030712.
The previous prime is 10010030711. The next prime is 10010030747. The reversal of 10010030713 is 31703001001.
It is a happy number.
10010030713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8041067584 + 1968963129 = 89672^2 + 44373^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010030713 - 21 = 10010030711 is a prime.
Together with 10010030711, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10010030711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005015356 + 5005015357.
It is an arithmetic number, because the mean of its divisors is an integer number (5005015357).
Almost surely, 210010030713 is an apocalyptic number.
It is an amenable number.
10010030713 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010030713 is an equidigital number, since it uses as much as digits as its factorization.
10010030713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 16.
Adding to 10010030713 its reverse (31703001001), we get a palindrome (41713031714).
The spelling of 10010030713 in words is "ten billion, ten million, thirty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •