Base | Representation |
---|---|
bin | 1010001100001101111011… |
… | …1101110101100110000111 |
3 | 1110200012002210102010211011 |
4 | 2203003132331311212013 |
5 | 2432040332424211411 |
6 | 35455302452223051 |
7 | 2234351504635345 |
oct | 243033675654607 |
9 | 43605083363734 |
10 | 11205015460231 |
11 | 363002512766a |
12 | 130b73500aa87 |
13 | 633822855a78 |
14 | 2aa47b7c0995 |
15 | 1467050dac21 |
hex | a30def75987 |
11205015460231 has 4 divisors (see below), whose sum is σ = 11315956207464. Its totient is φ = 11094074713000.
The previous prime is 11205015460229. The next prime is 11205015460259. The reversal of 11205015460231 is 13206451050211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11205015460231 - 21 = 11205015460229 is a prime.
It is a super-2 number, since 2×112050154602312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11205015460193 and 11205015460202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11205015460201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55470373465 + ... + 55470373666.
It is an arithmetic number, because the mean of its divisors is an integer number (2828989051866).
Almost surely, 211205015460231 is an apocalyptic number.
11205015460231 is a deficient number, since it is larger than the sum of its proper divisors (110940747233).
11205015460231 is a wasteful number, since it uses less digits than its factorization.
11205015460231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110940747232.
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 11205015460231 in words is "eleven trillion, two hundred five billion, fifteen million, four hundred sixty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •