Base | Representation |
---|---|
bin | 10010110101001110… |
… | …00101100010010001 |
3 | 222002120222211112011 |
4 | 21122213011202101 |
5 | 131201143132241 |
6 | 4351115102521 |
7 | 505352455414 |
oct | 113247054221 |
9 | 28076884464 |
10 | 10110130321 |
11 | 43189a5605 |
12 | 1b61a41a41 |
13 | c51769c45 |
14 | 6bca2db7b |
15 | 3e28b4281 |
hex | 25a9c5891 |
10110130321 has 2 divisors, whose sum is σ = 10110130322. Its totient is φ = 10110130320.
The previous prime is 10110130297. The next prime is 10110130343. The reversal of 10110130321 is 12303101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7092166225 + 3017964096 = 84215^2 + 54936^2 .
It is an emirp because it is prime and its reverse (12303101101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10110130321 - 27 = 10110130193 is a prime.
It is not a weakly prime, because it can be changed into another prime (10110130351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055065160 + 5055065161.
It is an arithmetic number, because the mean of its divisors is an integer number (5055065161).
Almost surely, 210110130321 is an apocalyptic number.
It is an amenable number.
10110130321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110130321 is an equidigital number, since it uses as much as digits as its factorization.
10110130321 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 10110130321 its reverse (12303101101), we get a palindrome (22413231422).
The spelling of 10110130321 in words is "ten billion, one hundred ten million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •