Base | Representation |
---|---|
bin | 10110111101111010110000… |
… | …100000010000001010001101 |
3 | 111020122122122002211102102122 |
4 | 112331322300200100022031 |
5 | 101214440040020042031 |
6 | 554500135000102325 |
7 | 30163606402153001 |
oct | 2675726040201215 |
9 | 436578562742378 |
10 | 101012002112141 |
11 | 2a204a498a660a |
12 | b3b49771649a5 |
13 | 4449510b35793 |
14 | 1ad3015266701 |
15 | ba2849a7247b |
hex | 5bdeb081028d |
101012002112141 has 2 divisors, whose sum is σ = 101012002112142. Its totient is φ = 101012002112140.
The previous prime is 101012002112083. The next prime is 101012002112201. The reversal of 101012002112141 is 141211200210101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54369180614116 + 46642821498025 = 7373546^2 + 6829555^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101012002112141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101012002112741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50506001056070 + 50506001056071.
It is an arithmetic number, because the mean of its divisors is an integer number (50506001056071).
Almost surely, 2101012002112141 is an apocalyptic number.
It is an amenable number.
101012002112141 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012002112141 is an equidigital number, since it uses as much as digits as its factorization.
101012002112141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101012002112141 its reverse (141211200210101), we get a palindrome (242223202322242).
The spelling of 101012002112141 in words is "one hundred one trillion, twelve billion, two million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •