Base | Representation |
---|---|
bin | 1001001100011111011101… |
… | …1111001111110101000101 |
3 | 1022210112012221012001200021 |
4 | 2103013313133033311011 |
5 | 2311121202303224031 |
6 | 33300322204215141 |
7 | 2062303301601235 |
oct | 223076737176505 |
9 | 38715187161607 |
10 | 10110210211141 |
11 | 3248797100947 |
12 | 1173514b3a4b1 |
13 | 584509076401 |
14 | 26d4a01d1cc5 |
15 | 127eca710511 |
hex | 931f77cfd45 |
10110210211141 has 2 divisors, whose sum is σ = 10110210211142. Its totient is φ = 10110210211140.
The previous prime is 10110210211111. The next prime is 10110210211147. The reversal of 10110210211141 is 14111201201101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6631891960516 + 3478318250625 = 2575246^2 + 1865025^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110210211141 - 211 = 10110210209093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110210211147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055105105570 + 5055105105571.
It is an arithmetic number, because the mean of its divisors is an integer number (5055105105571).
Almost surely, 210110210211141 is an apocalyptic number.
It is an amenable number.
10110210211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110210211141 is an equidigital number, since it uses as much as digits as its factorization.
10110210211141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10110210211141 its reverse (14111201201101), we get a palindrome (24221411412242).
The spelling of 10110210211141 in words is "ten trillion, one hundred ten billion, two hundred ten million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •