Base | Representation |
---|---|
bin | 10011110101001001… |
… | …00100011001011101 |
3 | 1000110221222011120211 |
4 | 21322210210121131 |
5 | 133300430404323 |
6 | 4520232012421 |
7 | 524553256444 |
oct | 117244443135 |
9 | 30427864524 |
10 | 10646341213 |
11 | 4573644802 |
12 | 2091531111 |
13 | 100888ccb1 |
14 | 72dd2dd5b |
15 | 4249d170d |
hex | 27a92465d |
10646341213 has 2 divisors, whose sum is σ = 10646341214. Its totient is φ = 10646341212.
The previous prime is 10646341183. The next prime is 10646341241. The reversal of 10646341213 is 31214364601.
It is a happy number.
10646341213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10079758404 + 566582809 = 100398^2 + 23803^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10646341213 is a prime.
It is a super-2 number, since 2×106463412132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10646341283) 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, 5323170606 + 5323170607.
It is an arithmetic number, because the mean of its divisors is an integer number (5323170607).
Almost surely, 210646341213 is an apocalyptic number.
It is an amenable number.
10646341213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10646341213 is an equidigital number, since it uses as much as digits as its factorization.
10646341213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 10646341213 in words is "ten billion, six hundred forty-six million, three hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •