Base | Representation |
---|---|
bin | 10010110101100101… |
… | …10110111001100101 |
3 | 222002210210121102022 |
4 | 21122302312321211 |
5 | 131202440403401 |
6 | 4351305152525 |
7 | 505420630022 |
oct | 113262667145 |
9 | 28083717368 |
10 | 10113216101 |
11 | 431a712a3a |
12 | 1b62a8b745 |
13 | c522aa651 |
14 | 6bd1d4549 |
15 | 3e2cc371b |
hex | 25acb6e65 |
10113216101 has 2 divisors, whose sum is σ = 10113216102. Its totient is φ = 10113216100.
The previous prime is 10113216079. The next prime is 10113216107. The reversal of 10113216101 is 10161231101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5994785476 + 4118430625 = 77426^2 + 64175^2 .
It is a cyclic number.
It is not a de Polignac number, because 10113216101 - 226 = 10046107237 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10113216101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10113216107) 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, 5056608050 + 5056608051.
It is an arithmetic number, because the mean of its divisors is an integer number (5056608051).
Almost surely, 210113216101 is an apocalyptic number.
It is an amenable number.
10113216101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113216101 is an equidigital number, since it uses as much as digits as its factorization.
10113216101 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 10113216101 its reverse (10161231101), we get a palindrome (20274447202).
The spelling of 10113216101 in words is "ten billion, one hundred thirteen million, two hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •