Base | Representation |
---|---|
bin | 10111000000101010110001… |
… | …101010110010001001001110 |
3 | 111021022201110201002121211211 |
4 | 113000222301222302021032 |
5 | 101231034122023223042 |
6 | 555123033033205034 |
7 | 30213350061405355 |
oct | 2700526152621116 |
9 | 437281421077754 |
10 | 101201000211022 |
11 | 2a278115350648 |
12 | b42552226077a |
13 | 44612a0a12b9a |
14 | 1adc22410099c |
15 | ba770c1ce017 |
hex | 5c0ab1ab224e |
101201000211022 has 8 divisors (see below), whose sum is σ = 153366464237616. Its totient is φ = 50078845465152.
The previous prime is 101201000211013. The next prime is 101201000211029. The reversal of 101201000211022 is 220112000102101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1012010002110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101201000210993 and 101201000211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101201000211029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 260827319938 + ... + 260827320325.
It is an arithmetic number, because the mean of its divisors is an integer number (19170808029702).
Almost surely, 2101201000211022 is an apocalyptic number.
101201000211022 is a deficient number, since it is larger than the sum of its proper divisors (52165464026594).
101201000211022 is an equidigital number, since it uses as much as digits as its factorization.
101201000211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521654640362.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101201000211022 its reverse (220112000102101), we get a palindrome (321313000313123).
The spelling of 101201000211022 in words is "one hundred one trillion, two hundred one billion, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •