Base | Representation |
---|---|
bin | 100000000110111001111101… |
… | …100110111010010010010101 |
3 | 200111222201222000022020010110 |
4 | 200012321331212322102111 |
5 | 122002104230240010401 |
6 | 1220155525551513233 |
7 | 41513143021162614 |
oct | 4006717546722225 |
9 | 614881860266113 |
10 | 141212042110101 |
11 | 40aa3766420946 |
12 | 13a07a0b228819 |
13 | 60a4313ab5031 |
14 | 26c29b0c7587b |
15 | 114d3b14b49d6 |
hex | 806e7d9ba495 |
141212042110101 has 24 divisors (see below), whose sum is σ = 196844921230720. Its totient is φ = 90039076117056.
The previous prime is 141212042110043. The next prime is 141212042110109. The reversal of 141212042110101 is 101011240212141.
141212042110101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141212042110101 - 234 = 141194862240917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141212042110109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11047620 + ... + 20111538.
Almost surely, 2141212042110101 is an apocalyptic number.
It is an amenable number.
141212042110101 is a deficient number, since it is larger than the sum of its proper divisors (55632879120619).
141212042110101 is an equidigital number, since it uses as much as digits as its factorization.
141212042110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9073785 (or 9073762 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 141212042110101 its reverse (101011240212141), we get a palindrome (242223282322242).
The spelling of 141212042110101 in words is "one hundred forty-one trillion, two hundred twelve billion, forty-two million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •