Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …11010001110110111001110 |
3 | 2122121000212120212112102120 |
4 | 10212033201322032313032 |
5 | 10122241433001413402 |
6 | 111001010542033410 |
7 | 4154601302241630 |
oct | 446174172166716 |
9 | 78530776775376 |
10 | 20220201201102 |
11 | 6496380490661 |
12 | 2326988578866 |
13 | b389ab895736 |
14 | 4dc93d23aa50 |
15 | 250e91a6b3bc |
hex | 1263e1e8edce |
20220201201102 has 64 divisors (see below), whose sum is σ = 46850547640320. Its totient is φ = 5698231958016.
The previous prime is 20220201201073. The next prime is 20220201201113. The reversal of 20220201201102 is 20110210202202.
It is a super-2 number, since 2×202202012011022 (a number of 27 digits) contains 22 as substring.
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, 122908 + ... + 6360464.
It is an arithmetic number, because the mean of its divisors is an integer number (732039806880).
Almost surely, 220220201201102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20220201201102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23425273820160).
20220201201102 is an abundant number, since it is smaller than the sum of its proper divisors (26630346439218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220201201102 is a wasteful number, since it uses less digits than its factorization.
20220201201102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6238625.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20220201201102 its reverse (20110210202202), we get a palindrome (40330411403304).
The spelling of 20220201201102 in words is "twenty trillion, two hundred twenty billion, two hundred one million, two hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •