Base | Representation |
---|---|
bin | 10011001011111110… |
… | …10100011100010101 |
3 | 222120220012122200121 |
4 | 21211333110130111 |
5 | 132044031012323 |
6 | 4422054511541 |
7 | 513161220613 |
oct | 114577243425 |
9 | 28526178617 |
10 | 10301032213 |
11 | 4406733a6a |
12 | 1bb59655b1 |
13 | c8218a044 |
14 | 6da1246b3 |
15 | 404522a5d |
hex | 265fd4715 |
10301032213 has 2 divisors, whose sum is σ = 10301032214. Its totient is φ = 10301032212.
The previous prime is 10301032211. The next prime is 10301032303. The reversal of 10301032213 is 31223010301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10004400484 + 296631729 = 100022^2 + 17223^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301032213 - 21 = 10301032211 is a prime.
It is a super-2 number, since 2×103010322132 (a number of 21 digits) contains 22 as substring.
Together with 10301032211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10301032211) 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, 5150516106 + 5150516107.
It is an arithmetic number, because the mean of its divisors is an integer number (5150516107).
Almost surely, 210301032213 is an apocalyptic number.
It is an amenable number.
10301032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301032213 is an equidigital number, since it uses as much as digits as its factorization.
10301032213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10301032213 its reverse (31223010301), we get a palindrome (41524042514).
The spelling of 10301032213 in words is "ten billion, three hundred one million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •