Base | Representation |
---|---|
bin | 1001001001010101111100… |
… | …10101111110000001110000 |
3 | 2122012201011220120222011220 |
4 | 10210222332111332001300 |
5 | 10114004321424410000 |
6 | 110435233035105040 |
7 | 4144026546640563 |
oct | 444527625760160 |
9 | 78181156528156 |
10 | 20112230310000 |
11 | 645460475a054 |
12 | 2309a752a2180 |
13 | b2b7628953aa |
14 | 4d761972c4da |
15 | 24d272b861a0 |
hex | 124abe57e070 |
20112230310000 has 100 divisors (see below), whose sum is σ = 64924961168232. Its totient is φ = 5363261408000.
The previous prime is 20112230309981. The next prime is 20112230310037. The reversal of 20112230310000 is 1303221102.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×201122303100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 335173839 + ... + 335233838.
Almost surely, 220112230310000 is an apocalyptic number.
20112230310000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112230310000 is an abundant number, since it is smaller than the sum of its proper divisors (44812730858232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112230310000 is an equidigital number, since it uses as much as digits as its factorization.
20112230310000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 670407708 (or 670407687 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20112230310000 its reverse (1303221102), we get a palindrome (20113533531102).
The spelling of 20112230310000 in words is "twenty trillion, one hundred twelve billion, two hundred thirty million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •