Base | Representation |
---|---|
bin | 10000001010101110000… |
… | …000110001110100101110 |
3 | 10221012201222000200100010 |
4 | 100022232000301310232 |
5 | 121200332334031110 |
6 | 2210221311514050 |
7 | 143161064461542 |
oct | 20125600616456 |
9 | 3835658020303 |
10 | 1111021002030 |
11 | 3991aa433a35 |
12 | 15b3a6828926 |
13 | 809cc177154 |
14 | 3bab9083a22 |
15 | 1dd782dd020 |
hex | 102ae031d2e |
1111021002030 has 64 divisors (see below), whose sum is σ = 2825599256640. Its totient is φ = 278617442304.
The previous prime is 1111021001983. The next prime is 1111021002031. The reversal of 1111021002030 is 302001201111.
It is a junction number, because it is equal to n+sod(n) for n = 1111021001997 and 1111021002015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111021002031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 259489 + ... + 1513068.
It is an arithmetic number, because the mean of its divisors is an integer number (44149988385).
Almost surely, 21111021002030 is an apocalyptic number.
1111021002030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1111021002030 is an abundant number, since it is smaller than the sum of its proper divisors (1714578254610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111021002030 is a wasteful number, since it uses less digits than its factorization.
1111021002030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1773813.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1111021002030 its reverse (302001201111), we get a palindrome (1413022203141).
The spelling of 1111021002030 in words is "one trillion, one hundred eleven billion, twenty-one million, two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •