Base | Representation |
---|---|
bin | 1001010111101010101100… |
… | …1010000100100110001011 |
3 | 1100110212210020201101001221 |
4 | 2111322223022010212023 |
5 | 2322242402444320021 |
6 | 33524433342422511 |
7 | 2112211124442235 |
oct | 225725312044613 |
9 | 40425706641057 |
10 | 10302203120011 |
11 | 331215a0a0a60 |
12 | 11a4776b91a37 |
13 | 59965553b92a |
14 | 2788b4ac1255 |
15 | 12ceb5c38241 |
hex | 95eab28498b |
10302203120011 has 16 divisors (see below), whose sum is σ = 11258436157920. Its totient is φ = 9349258129920.
The previous prime is 10302203119997. The next prime is 10302203120023. The reversal of 10302203120011 is 11002130220301.
It is a cyclic number.
It is not a de Polignac number, because 10302203120011 - 211 = 10302203117963 is a prime.
It is a super-2 number, since 2×103022031200112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10302203150011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20791501 + ... + 21281233.
It is an arithmetic number, because the mean of its divisors is an integer number (703652259870).
Almost surely, 210302203120011 is an apocalyptic number.
10302203120011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10302203120011 is a deficient number, since it is larger than the sum of its proper divisors (956233037909).
10302203120011 is a wasteful number, since it uses less digits than its factorization.
10302203120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493086.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10302203120011 its reverse (11002130220301), we get a palindrome (21304333340312).
The spelling of 10302203120011 in words is "ten trillion, three hundred two billion, two hundred three million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •