Base | Representation |
---|---|
bin | 1001100110101101001000… |
… | …11000001100111001011101 |
3 | 2202210011021121111002210201 |
4 | 10303112210120030321131 |
5 | 10232022014133032031 |
6 | 112530523243103501 |
7 | 4306643562555034 |
oct | 463264430147135 |
9 | 82704247432721 |
10 | 21121112002141 |
11 | 680346010a788 |
12 | 24514b5811b91 |
13 | ba2934c5a568 |
14 | 5303a559171b |
15 | 26961e009d61 |
hex | 1335a460ce5d |
21121112002141 has 2 divisors, whose sum is σ = 21121112002142. Its totient is φ = 21121112002140.
The previous prime is 21121112002087. The next prime is 21121112002231. The reversal of 21121112002141 is 14120021112112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17217761026041 + 3903350976100 = 4149429^2 + 1975690^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121112002141 - 219 = 21121111477853 is a prime.
It is a super-2 number, since 2×211211120021412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21121112072141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560556001070 + 10560556001071.
It is an arithmetic number, because the mean of its divisors is an integer number (10560556001071).
Almost surely, 221121112002141 is an apocalyptic number.
It is an amenable number.
21121112002141 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121112002141 is an equidigital number, since it uses as much as digits as its factorization.
21121112002141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 21121112002141 its reverse (14120021112112), we get a palindrome (35241133114253).
The spelling of 21121112002141 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred twelve million, two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •