Base | Representation |
---|---|
bin | 11001011110000111101101… |
… | …001110110001100001000000 |
3 | 112200122002211122012222101012 |
4 | 121132013231032301201000 |
5 | 104140323023130320000 |
6 | 1034125425213500052 |
7 | 32411152233221330 |
oct | 3136075516614100 |
9 | 480562748188335 |
10 | 112021022120000 |
11 | 32769937671974 |
12 | 106925117a1628 |
13 | 4a676c9bc3996 |
14 | 1d93bbc7410c0 |
15 | ce3dcd05b735 |
hex | 65e1ed3b1840 |
112021022120000 has 140 divisors (see below), whose sum is σ = 317457975679680. Its totient is φ = 38407207488000.
The previous prime is 112021022119999. The next prime is 112021022120009. The reversal of 112021022120000 is 21220120211.
It is a tau number, because it is divible by the number of its divisors (140).
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (112021022120009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 199757540 + ... + 200317539.
Almost surely, 2112021022120000 is an apocalyptic number.
112021022120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112021022120000 is an abundant number, since it is smaller than the sum of its proper divisors (205436953559680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112021022120000 is an frugal number, since it uses more digits than its factorization.
112021022120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400075118 (or 400075093 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112021022120000 its reverse (21220120211), we get a palindrome (112042242240211).
The spelling of 112021022120000 in words is "one hundred twelve trillion, twenty-one billion, twenty-two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •