Base | Representation |
---|---|
bin | 10110110000111100111100… |
… | …101100110100111010001111 |
3 | 111010111110210201002021112122 |
4 | 112300330330230310322033 |
5 | 101110340302230133241 |
6 | 552534541454323155 |
7 | 30042334511640362 |
oct | 2660747454647217 |
9 | 433443721067478 |
10 | 100121001021071 |
11 | 299a1094a22238 |
12 | b2901547b94bb |
13 | 43b34a6837174 |
14 | 1aa1c4d0900d9 |
15 | b8959c5a904b |
hex | 5b0f3cb34e8f |
100121001021071 has 2 divisors, whose sum is σ = 100121001021072. Its totient is φ = 100121001021070.
The previous prime is 100121001021061. The next prime is 100121001021161. The reversal of 100121001021071 is 170120100121001.
It is a weak prime.
It is an emirp because it is prime and its reverse (170120100121001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100121001021071 is a prime.
It is a super-3 number, since 3×1001210010210713 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100121001021011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060500510535 + 50060500510536.
It is an arithmetic number, because the mean of its divisors is an integer number (50060500510536).
Almost surely, 2100121001021071 is an apocalyptic number.
100121001021071 is a deficient number, since it is larger than the sum of its proper divisors (1).
100121001021071 is an equidigital number, since it uses as much as digits as its factorization.
100121001021071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 100121001021071 its reverse (170120100121001), we get a palindrome (270241101142072).
The spelling of 100121001021071 in words is "one hundred trillion, one hundred twenty-one billion, one million, twenty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •