Base | Representation |
---|---|
bin | 101111001000100101… |
… | …1101100100010011101 |
3 | 100200021012022021112111 |
4 | 1132101023230202131 |
5 | 3124244310311031 |
6 | 114255544034021 |
7 | 10212216614245 |
oct | 1362113544235 |
9 | 320235267474 |
10 | 101220010141 |
11 | 39a22069848 |
12 | 1774a462911 |
13 | 97114bbb33 |
14 | 4c830bcb25 |
15 | 29763c91b1 |
hex | 17912ec89d |
101220010141 has 2 divisors, whose sum is σ = 101220010142. Its totient is φ = 101220010140.
The previous prime is 101220010117. The next prime is 101220010163. The reversal of 101220010141 is 141010022101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94523042916 + 6696967225 = 307446^2 + 81835^2 .
It is a cyclic number.
It is not a de Polignac number, because 101220010141 - 29 = 101220009629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101220010181) 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, 50610005070 + 50610005071.
It is an arithmetic number, because the mean of its divisors is an integer number (50610005071).
Almost surely, 2101220010141 is an apocalyptic number.
It is an amenable number.
101220010141 is a deficient number, since it is larger than the sum of its proper divisors (1).
101220010141 is an equidigital number, since it uses as much as digits as its factorization.
101220010141 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 13.
Adding to 101220010141 its reverse (141010022101), we get a palindrome (242230032242).
The spelling of 101220010141 in words is "one hundred one billion, two hundred twenty million, ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •