Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …10100011110010100000010 |
3 | 2121220002120100101212201020 |
4 | 10203113002310132110002 |
5 | 10111020240420232320 |
6 | 110330010355450310 |
7 | 4134356402212500 |
oct | 443270264362402 |
9 | 77802510355636 |
10 | 20022111102210 |
11 | 641a369818428 |
12 | 22b45045b6996 |
13 | b23100165979 |
14 | 4d310aa7d670 |
15 | 24ac4b10d940 |
hex | 1235c2d1e502 |
20022111102210 has 96 divisors (see below), whose sum is σ = 55903371962112. Its totient is φ = 4576080821760.
The previous prime is 20022111102193. The next prime is 20022111102241. The reversal of 20022111102210 is 1220111122002.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20022111102210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16317370 + ... + 17501450.
It is an arithmetic number, because the mean of its divisors is an integer number (582326791272).
Almost surely, 220022111102210 is an apocalyptic number.
20022111102210 is an abundant number, since it is smaller than the sum of its proper divisors (35881260859902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022111102210 is a wasteful number, since it uses less digits than its factorization.
20022111102210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1195608 (or 1195601 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20022111102210 its reverse (1220111122002), we get a palindrome (21242222224212).
The spelling of 20022111102210 in words is "twenty trillion, twenty-two billion, one hundred eleven million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •