Base | Representation |
---|---|
bin | 101111000110010001… |
… | …1101110011000010101 |
3 | 100200001210022110001221 |
4 | 1132030203232120111 |
5 | 3124114430014221 |
6 | 114244133050341 |
7 | 10210255260661 |
oct | 1361443563025 |
9 | 320053273057 |
10 | 101142423061 |
11 | 39992296499 |
12 | 177284869b1 |
13 | 96cb3c4b14 |
14 | 4c76a838a1 |
15 | 296e6a0541 |
hex | 178c8ee615 |
101142423061 has 2 divisors, whose sum is σ = 101142423062. Its totient is φ = 101142423060.
The previous prime is 101142423023. The next prime is 101142423077. The reversal of 101142423061 is 160324241101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96463042225 + 4679380836 = 310585^2 + 68406^2 .
It is an emirp because it is prime and its reverse (160324241101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101142423061 - 225 = 101108868629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101142420061) 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, 50571211530 + 50571211531.
It is an arithmetic number, because the mean of its divisors is an integer number (50571211531).
Almost surely, 2101142423061 is an apocalyptic number.
It is an amenable number.
101142423061 is a deficient number, since it is larger than the sum of its proper divisors (1).
101142423061 is an equidigital number, since it uses as much as digits as its factorization.
101142423061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101142423061 its reverse (160324241101), we get a palindrome (261466664162).
The spelling of 101142423061 in words is "one hundred one billion, one hundred forty-two million, four hundred twenty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •