Base | Representation |
---|---|
bin | 10110111110000011001000… |
… | …110100100001000101100001 |
3 | 111020200111212011222002202202 |
4 | 112332003020310201011201 |
5 | 101220112002000342004 |
6 | 554504223504222545 |
7 | 30164345361066401 |
oct | 2676031064410541 |
9 | 436614764862682 |
10 | 101021000012129 |
11 | 2a208846992a9a |
12 | b3b666860aa55 |
13 | 444a31602bc62 |
14 | 1ad362a292801 |
15 | ba2bc4986b1e |
hex | 5be0c8d21161 |
101021000012129 has 2 divisors, whose sum is σ = 101021000012130. Its totient is φ = 101021000012128.
The previous prime is 101021000012099. The next prime is 101021000012143. The reversal of 101021000012129 is 921210000120101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100156561230625 + 864438781504 = 10007825^2 + 929752^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101021000012129 is a prime.
It is a super-2 number, since 2×1010210000121292 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101021000012129.
It is not a weakly prime, because it can be changed into another prime (101021000012729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510500006064 + 50510500006065.
It is an arithmetic number, because the mean of its divisors is an integer number (50510500006065).
Almost surely, 2101021000012129 is an apocalyptic number.
It is an amenable number.
101021000012129 is a deficient number, since it is larger than the sum of its proper divisors (1).
101021000012129 is an equidigital number, since it uses as much as digits as its factorization.
101021000012129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 101021000012129 in words is "one hundred one trillion, twenty-one billion, twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •