Base | Representation |
---|---|
bin | 10000001010101110001… |
… | …001100011101010100010 |
3 | 10221012202010100121010110 |
4 | 100022232021203222202 |
5 | 121200333431201310 |
6 | 2210221433112150 |
7 | 143161123155063 |
oct | 20125611435242 |
9 | 3835663317113 |
10 | 1111023303330 |
11 | 399200765a36 |
12 | 15b3a7558656 |
13 | 809cc7a1775 |
14 | 3bab94c256a |
15 | 1dd785e4d20 |
hex | 102ae263aa2 |
1111023303330 has 32 divisors (see below), whose sum is σ = 2666490321600. Its totient is φ = 296269059392.
The previous prime is 1111023303323. The next prime is 1111023303347. The reversal of 1111023303330 is 333033201111.
It is a junction number, because it is equal to n+sod(n) for n = 1111023303297 and 1111023303306.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2731216 + ... + 3111524.
It is an arithmetic number, because the mean of its divisors is an integer number (83327822550).
Almost surely, 21111023303330 is an apocalyptic number.
1111023303330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1111023303330 is an abundant number, since it is smaller than the sum of its proper divisors (1555467018270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111023303330 is a wasteful number, since it uses less digits than its factorization.
1111023303330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477698.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1111023303330 its reverse (333033201111), we get a palindrome (1444056504441).
The spelling of 1111023303330 in words is "one trillion, one hundred eleven billion, twenty-three million, three hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •