Base | Representation |
---|---|
bin | 10111000011101111101010… |
… | …001101011010010101100111 |
3 | 111022001221010200020212201021 |
4 | 113003233222031122111213 |
5 | 101243020044431211101 |
6 | 555404114151512011 |
7 | 30234542602634344 |
oct | 2703575215322547 |
9 | 438057120225637 |
10 | 101412402210151 |
11 | 2a34983826051a |
12 | b45a4a0388607 |
13 | 44781c131abb6 |
14 | 1b0855a6177cb |
15 | bace8164d5a1 |
hex | 5c3bea35a567 |
101412402210151 has 2 divisors, whose sum is σ = 101412402210152. Its totient is φ = 101412402210150.
The previous prime is 101412402210109. The next prime is 101412402210209. The reversal of 101412402210151 is 151012204214101.
It is a weak prime.
It is an emirp because it is prime and its reverse (151012204214101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101412402210151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101412402210451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50706201105075 + 50706201105076.
It is an arithmetic number, because the mean of its divisors is an integer number (50706201105076).
Almost surely, 2101412402210151 is an apocalyptic number.
101412402210151 is a deficient number, since it is larger than the sum of its proper divisors (1).
101412402210151 is an equidigital number, since it uses as much as digits as its factorization.
101412402210151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 25.
Adding to 101412402210151 its reverse (151012204214101), we get a palindrome (252424606424252).
The spelling of 101412402210151 in words is "one hundred one trillion, four hundred twelve billion, four hundred two million, two hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •