Base | Representation |
---|---|
bin | 10111000000110011001011… |
… | …011010001011100101111101 |
3 | 111021100120202110012001010011 |
4 | 113000303023122023211331 |
5 | 101231211111113013041 |
6 | 555131124153343221 |
7 | 30214116460352203 |
oct | 2700631332134575 |
9 | 437316673161104 |
10 | 101210022001021 |
11 | 2a280a24974a3a |
12 | b42721b707b11 |
13 | 44620aab5226b |
14 | 1adc83c389073 |
15 | ba7a89261e81 |
hex | 5c0ccb68b97d |
101210022001021 has 2 divisors, whose sum is σ = 101210022001022. Its totient is φ = 101210022001020.
The previous prime is 101210022000977. The next prime is 101210022001061. The reversal of 101210022001021 is 120100220012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81554445562500 + 19655576438521 = 9030750^2 + 4433461^2 .
It is a cyclic number.
It is not a de Polignac number, because 101210022001021 - 211 = 101210021998973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101210022000992 and 101210022001010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101210022001061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605011000510 + 50605011000511.
It is an arithmetic number, because the mean of its divisors is an integer number (50605011000511).
Almost surely, 2101210022001021 is an apocalyptic number.
It is an amenable number.
101210022001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101210022001021 is an equidigital number, since it uses as much as digits as its factorization.
101210022001021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101210022001021 its reverse (120100220012101), we get a palindrome (221310242013122).
The spelling of 101210022001021 in words is "one hundred one trillion, two hundred ten billion, twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •