Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …110011101000001101111110 |
3 | 111020121121111110100101222102 |
4 | 112331300212303220031332 |
5 | 101214300224103013042 |
6 | 554451133220545102 |
7 | 30163042314560246 |
oct | 2675604663501576 |
9 | 436547443311872 |
10 | 101001102001022 |
11 | 2a200365a93813 |
12 | b3b2834852192 |
13 | 44484948131a2 |
14 | 1ad269d758b26 |
15 | ba240cb64b32 |
hex | 5bdc26ce837e |
101001102001022 has 64 divisors (see below), whose sum is σ = 166528012285440. Its totient is φ = 45729836697600.
The previous prime is 101001102000919. The next prime is 101001102001073. The reversal of 101001102001022 is 220100201100101.
It is a super-3 number, since 3×1010011020010223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101001102000994 and 101001102001012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8959552778 + ... + 8959564050.
It is an arithmetic number, because the mean of its divisors is an integer number (2602000191960).
Almost surely, 2101001102001022 is an apocalyptic number.
101001102001022 is a deficient number, since it is larger than the sum of its proper divisors (65526910284418).
101001102001022 is a wasteful number, since it uses less digits than its factorization.
101001102001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17729.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101001102001022 its reverse (220100201100101), we get a palindrome (321101303101123).
The spelling of 101001102001022 in words is "one hundred one trillion, one billion, one hundred two million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •