Base | Representation |
---|---|
bin | 10111000000110101000010… |
… | …100000110010100001000100 |
3 | 111021100202220201012012000022 |
4 | 113000311002200302201010 |
5 | 101231224204134101040 |
6 | 555132054334234312 |
7 | 30214220133064331 |
oct | 2700650240624104 |
9 | 437322821165008 |
10 | 101212020222020 |
11 | 2a28185a906a54 |
12 | b427698955998 |
13 | 4462338b25956 |
14 | 1adc98b8dd988 |
15 | ba7b548c26b5 |
hex | 5c0d42832844 |
101212020222020 has 48 divisors (see below), whose sum is σ = 217500538590720. Its totient is φ = 39541049377536.
The previous prime is 101212020222007. The next prime is 101212020222083. The reversal of 101212020222020 is 20222020212101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 101212020222020.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11802029 + ... + 18485451.
It is an arithmetic number, because the mean of its divisors is an integer number (4531261220640).
Almost surely, 2101212020222020 is an apocalyptic number.
101212020222020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101212020222020 is an abundant number, since it is smaller than the sum of its proper divisors (116288518368700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101212020222020 is a wasteful number, since it uses less digits than its factorization.
101212020222020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6701084 (or 6701082 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 101212020222020 its reverse (20222020212101), we get a palindrome (121434040434121).
The spelling of 101212020222020 in words is "one hundred one trillion, two hundred twelve billion, twenty million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •