Base | Representation |
---|---|
bin | 1001001100011110111001… |
… | …00010101001010101101100 |
3 | 2122121000122022101112212100 |
4 | 10212033130202221111230 |
5 | 10122241241422211022 |
6 | 111000554003335100 |
7 | 4154566126540551 |
oct | 446173442512554 |
9 | 78530568345770 |
10 | 20220111132012 |
11 | 64963346623a0 |
12 | 2326962381490 |
13 | b3899601b20c |
14 | 4dc9312b2a28 |
15 | 250e88bc91ac |
hex | 1263dc8a956c |
20220111132012 has 72 divisors (see below), whose sum is σ = 55761373204992. Its totient is φ = 6126989378400.
The previous prime is 20220111131999. The next prime is 20220111132031. The reversal of 20220111132012 is 21023111102202.
20220111132012 is a `hidden beast` number, since 2 + 0 + 220 + 1 + 111 + 320 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6399313 + ... + 9021719.
It is an arithmetic number, because the mean of its divisors is an integer number (774463516736).
Almost surely, 220220111132012 is an apocalyptic number.
20220111132012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20220111132012 is an abundant number, since it is smaller than the sum of its proper divisors (35541262072980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220111132012 is a wasteful number, since it uses less digits than its factorization.
20220111132012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2641899 (or 2641894 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 20220111132012 its reverse (21023111102202), we get a palindrome (41243222234214).
The spelling of 20220111132012 in words is "twenty trillion, two hundred twenty billion, one hundred eleven million, one hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •