Base | Representation |
---|---|
bin | 11001001111101101110010… |
… | …100001110000100001010010 |
3 | 112120010110201201122212200220 |
4 | 121033231302201300201102 |
5 | 104023113213440133020 |
6 | 1032050554241453510 |
7 | 32246506453551351 |
oct | 3117556241604122 |
9 | 476113651585626 |
10 | 111031121021010 |
11 | 32418041271863 |
12 | 105526a9941296 |
13 | 49c5260c62b18 |
14 | 1d5bd13643998 |
15 | cc82931dc240 |
hex | 64fb72870852 |
111031121021010 has 32 divisors (see below), whose sum is σ = 266618964915072. Its totient is φ = 29592268442880.
The previous prime is 111031121021003. The next prime is 111031121021053. The reversal of 111031121021010 is 10120121130111.
It is a super-2 number, since 2×1110311210210102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1001849671 + ... + 1001960490.
It is an arithmetic number, because the mean of its divisors is an integer number (8331842653596).
Almost surely, 2111031121021010 is an apocalyptic number.
111031121021010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111031121021010 is an abundant number, since it is smaller than the sum of its proper divisors (155587843894062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111031121021010 is a wasteful number, since it uses less digits than its factorization.
111031121021010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2003812018.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 111031121021010 its reverse (10120121130111), we get a palindrome (121151242151121).
The spelling of 111031121021010 in words is "one hundred eleven trillion, thirty-one billion, one hundred twenty-one million, twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •