Base | Representation |
---|---|
bin | 11001010001001001111000… |
… | …111000111110110100100000 |
3 | 112120110220222121112010120010 |
4 | 121101021320320332310200 |
5 | 104031223231034120000 |
6 | 1032204231151044520 |
7 | 32256610203304641 |
oct | 3121117070766440 |
9 | 476426877463503 |
10 | 111130012020000 |
11 | 32455a786a4aa6 |
12 | 105698a8210740 |
13 | 4a01690a8c93c |
14 | 1d62a152a16c8 |
15 | ccab2edb3d50 |
hex | 651278e3ed20 |
111130012020000 has 240 divisors, whose sum is σ = 377098625312640. Its totient is φ = 28612784256000.
The previous prime is 111130012019977. The next prime is 111130012020073. The reversal of 111130012020000 is 20210031111.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 30193912 + ... + 33673911.
It is an arithmetic number, because the mean of its divisors is an integer number (1571244272136).
Almost surely, 2111130012020000 is an apocalyptic number.
111130012020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111130012020000 is an abundant number, since it is smaller than the sum of its proper divisors (265968613292640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111130012020000 is an equidigital number, since it uses as much as digits as its factorization.
111130012020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63867885 (or 63867862 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 111130012020000 its reverse (20210031111), we get a palindrome (111150222051111).
The spelling of 111130012020000 in words is "one hundred eleven trillion, one hundred thirty billion, twelve million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •