Base | Representation |
---|---|
bin | 10010110111110110… |
… | …10110110001010101 |
3 | 222011010120011020221 |
4 | 21123323112301111 |
5 | 131222322033023 |
6 | 4353224354341 |
7 | 506041312645 |
oct | 113373266125 |
9 | 28133504227 |
10 | 10132221013 |
11 | 432a413682 |
12 | 1b693159b1 |
13 | c56202b65 |
14 | 6c1940525 |
15 | 3e47c985d |
hex | 25bed6c55 |
10132221013 has 2 divisors, whose sum is σ = 10132221014. Its totient is φ = 10132221012.
The previous prime is 10132220957. The next prime is 10132221031. The reversal of 10132221013 is 31012223101.
10132221013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (10132221031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7666403364 + 2465817649 = 87558^2 + 49657^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10132221013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10132221313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066110506 + 5066110507.
It is an arithmetic number, because the mean of its divisors is an integer number (5066110507).
Almost surely, 210132221013 is an apocalyptic number.
It is an amenable number.
10132221013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132221013 is an equidigital number, since it uses as much as digits as its factorization.
10132221013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10132221013 its reverse (31012223101), we get a palindrome (41144444114).
The spelling of 10132221013 in words is "ten billion, one hundred thirty-two million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •