Base | Representation |
---|---|
bin | 10010110101001110… |
… | …00010000111100001 |
3 | 222002120222010022122 |
4 | 21122213002013201 |
5 | 131201142210241 |
6 | 4351114514025 |
7 | 505352366534 |
oct | 113247020741 |
9 | 28076863278 |
10 | 10110116321 |
11 | 4318996038 |
12 | 1b61a35915 |
13 | c51763766 |
14 | 6bca28a1b |
15 | 3e28b004b |
hex | 25a9c21e1 |
10110116321 has 2 divisors, whose sum is σ = 10110116322. Its totient is φ = 10110116320.
The previous prime is 10110116311. The next prime is 10110116327. The reversal of 10110116321 is 12361101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5889795025 + 4220321296 = 76745^2 + 64964^2 .
It is an emirp because it is prime and its reverse (12361101101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10110116321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110116321.
It is not a weakly prime, because it can be changed into another prime (10110116327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055058160 + 5055058161.
It is an arithmetic number, because the mean of its divisors is an integer number (5055058161).
Almost surely, 210110116321 is an apocalyptic number.
It is an amenable number.
10110116321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110116321 is an equidigital number, since it uses as much as digits as its factorization.
10110116321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10110116321 its reverse (12361101101), we get a palindrome (22471217422).
The spelling of 10110116321 in words is "ten billion, one hundred ten million, one hundred sixteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •