Base | Representation |
---|---|
bin | 10000001010111110110… |
… | …000110001110011001101 |
3 | 10221020110112210212221020 |
4 | 100022332300301303031 |
5 | 121201421304122201 |
6 | 2210305231024353 |
7 | 143201046213024 |
oct | 20127660616315 |
9 | 3836415725836 |
10 | 1111302020301 |
11 | 399334023140 |
12 | 15b46496b0b9 |
13 | 80a4545a155 |
14 | 3bb045158bb |
15 | 1dd92ceca36 |
hex | 102bec31ccd |
1111302020301 has 32 divisors (see below), whose sum is σ = 1640069544960. Its totient is φ = 663680438400.
The previous prime is 1111302020293. The next prime is 1111302020357. The reversal of 1111302020301 is 1030202031111.
It is a happy number.
It is not a de Polignac number, because 1111302020301 - 23 = 1111302020293 is a prime.
It is a super-2 number, since 2×11113020203012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111302000301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4358190 + ... + 4606128.
It is an arithmetic number, because the mean of its divisors is an integer number (51252173280).
Almost surely, 21111302020301 is an apocalyptic number.
1111302020301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1111302020301 is a deficient number, since it is larger than the sum of its proper divisors (528767524659).
1111302020301 is a wasteful number, since it uses less digits than its factorization.
1111302020301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249937.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1111302020301 its reverse (1030202031111), we get a palindrome (2141504051412).
The spelling of 1111302020301 in words is "one trillion, one hundred eleven billion, three hundred two million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •