Base | Representation |
---|---|
bin | 10011001100001111… |
… | …01011000111000101 |
3 | 222121001022220210201 |
4 | 21212013223013011 |
5 | 132100111102323 |
6 | 4422213450501 |
7 | 513215641504 |
oct | 114607530705 |
9 | 28531286721 |
10 | 10303222213 |
11 | 440799a389 |
12 | 1bb6640a31 |
13 | c82775abb |
14 | 6da53483b |
15 | 4048068ad |
hex | 2661eb1c5 |
10303222213 has 2 divisors, whose sum is σ = 10303222214. Its totient is φ = 10303222212.
The previous prime is 10303222199. The next prime is 10303222219. The reversal of 10303222213 is 31222230301.
10303222213 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., 9673312609 + 629909604 = 98353^2 + 25098^2 .
It is a cyclic number.
It is not a de Polignac number, because 10303222213 - 225 = 10269667781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10303222219) 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, 5151611106 + 5151611107.
It is an arithmetic number, because the mean of its divisors is an integer number (5151611107).
Almost surely, 210303222213 is an apocalyptic number.
It is an amenable number.
10303222213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10303222213 is an equidigital number, since it uses as much as digits as its factorization.
10303222213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10303222213 its reverse (31222230301), we get a palindrome (41525452514).
The spelling of 10303222213 in words is "ten billion, three hundred three million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •