Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …00001111110001000000110 |
3 | 2122011122012022212111200102 |
4 | 10210200201001332020012 |
5 | 10113313322241010042 |
6 | 110430134502244102 |
7 | 4143151355213330 |
oct | 444404101761006 |
9 | 78148168774612 |
10 | 20101001110022 |
11 | 644a872104998 |
12 | 2307860726632 |
13 | b2a69332b971 |
14 | 4d6c72238450 |
15 | 24cd16e20b32 |
hex | 12482107e206 |
20101001110022 has 8 divisors (see below), whose sum is σ = 34458859045776. Its totient is φ = 8614714761432.
The previous prime is 20101001109929. The next prime is 20101001110033. The reversal of 20101001110022 is 22001110010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×201010011100222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20101001109985 and 20101001110012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 717892896773 + ... + 717892896800.
It is an arithmetic number, because the mean of its divisors is an integer number (4307357380722).
Almost surely, 220101001110022 is an apocalyptic number.
20101001110022 is a deficient number, since it is larger than the sum of its proper divisors (14357857935754).
20101001110022 is a wasteful number, since it uses less digits than its factorization.
20101001110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1435785793582.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20101001110022 its reverse (22001110010102), we get a palindrome (42102111120124).
The spelling of 20101001110022 in words is "twenty trillion, one hundred one billion, one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •