Base | Representation |
---|---|
bin | 10010110101001101… |
… | …01101010101101101 |
3 | 222002120210210120111 |
4 | 21122212231111231 |
5 | 131201131444323 |
6 | 4351113020021 |
7 | 505351563442 |
oct | 113246552555 |
9 | 28076723514 |
10 | 10110031213 |
11 | 43189380a7 |
12 | 1b619b4611 |
13 | c51733ab9 |
14 | 6bca059c9 |
15 | 3e2894c0d |
hex | 25a9ad56d |
10110031213 has 2 divisors, whose sum is σ = 10110031214. Its totient is φ = 10110031212.
The previous prime is 10110031181. The next prime is 10110031357. The reversal of 10110031213 is 31213001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10052468644 + 57562569 = 100262^2 + 7587^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110031213 - 25 = 10110031181 is a prime.
It is a super-2 number, since 2×101100312132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110031193 and 10110031202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110331213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055015606 + 5055015607.
It is an arithmetic number, because the mean of its divisors is an integer number (5055015607).
Almost surely, 210110031213 is an apocalyptic number.
It is an amenable number.
10110031213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110031213 is an equidigital number, since it uses as much as digits as its factorization.
10110031213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 10110031213 its reverse (31213001101), we get a palindrome (41323032314).
The spelling of 10110031213 in words is "ten billion, one hundred ten million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •