Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …110111000100101101100110 |
3 | 111021022201112002201200022112 |
4 | 113000222302313010231212 |
5 | 101231034142133210042 |
6 | 555123035030001022 |
7 | 30213350423401445 |
oct | 2700526267045546 |
9 | 437281462650275 |
10 | 101201020210022 |
11 | 2a278125670147 |
12 | b425528aa6172 |
13 | 44612a4bc5a05 |
14 | 1adc226a28d5c |
15 | ba770dd2e982 |
hex | 5c0ab2dc4b66 |
101201020210022 has 8 divisors (see below), whose sum is σ = 159791084542200. Its totient is φ = 47937325362624.
The previous prime is 101201020210021. The next prime is 101201020210033. The reversal of 101201020210022 is 220012020102101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101201020209979 and 101201020210006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101201020210021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1331592371147 + ... + 1331592371222.
It is an arithmetic number, because the mean of its divisors is an integer number (19973885567775).
Almost surely, 2101201020210022 is an apocalyptic number.
101201020210022 is a deficient number, since it is larger than the sum of its proper divisors (58590064332178).
101201020210022 is a wasteful number, since it uses less digits than its factorization.
101201020210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2663184742390.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101201020210022 its reverse (220012020102101), we get a palindrome (321213040312123).
The spelling of 101201020210022 in words is "one hundred one trillion, two hundred one billion, twenty million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •