Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …010100000000111101100110 |
3 | 111020121201100001022211220110 |
4 | 112331301220110000331212 |
5 | 101214310001424310042 |
6 | 554451434240313450 |
7 | 30163111461155154 |
oct | 2675615024007546 |
9 | 436551301284813 |
10 | 101002201010022 |
11 | 2a20087a391514 |
12 | b3b2aa0912886 |
13 | 444860b407a80 |
14 | 1ad27656ba3d4 |
15 | ba24743a209c |
hex | 5bdc68500f66 |
101002201010022 has 128 divisors (see below), whose sum is σ = 240781596281856. Its totient is φ = 27928089649152.
The previous prime is 101002201009949. The next prime is 101002201010063. The reversal of 101002201010022 is 220010102200101.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 14229198 + ... + 20111550.
It is an arithmetic number, because the mean of its divisors is an integer number (1881106220952).
Almost surely, 2101002201010022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101002201010022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120390798140928).
101002201010022 is an abundant number, since it is smaller than the sum of its proper divisors (139779395271834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002201010022 is a wasteful number, since it uses less digits than its factorization.
101002201010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5882974.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101002201010022 its reverse (220010102200101), we get a palindrome (321012303210123).
The spelling of 101002201010022 in words is "one hundred one trillion, two billion, two hundred one million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •