Base | Representation |
---|---|
bin | 10100111010111000… |
… | …00101011111011111 |
3 | 1001222201201011122222 |
4 | 22131130011133133 |
5 | 141000204220111 |
6 | 5054250055555 |
7 | 545215434161 |
oct | 123534053737 |
9 | 31881634588 |
10 | 11231320031 |
11 | 4843872a78 |
12 | 221541a5bb |
13 | 109cb296c9 |
14 | 7878c6931 |
15 | 45b0337db |
hex | 29d7057df |
11231320031 has 4 divisors (see below), whose sum is σ = 11231532000. Its totient is φ = 11231108064.
The previous prime is 11231320019. The next prime is 11231320039. The reversal of 11231320031 is 13002313211.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 11231320031 - 222 = 11227125727 is a prime.
It is a super-2 number, since 2×112313200312 (a number of 21 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 = 11231319991 and 11231320009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11231320039) 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, 51290 + ... + 158408.
It is an arithmetic number, because the mean of its divisors is an integer number (2807883000).
Almost surely, 211231320031 is an apocalyptic number.
11231320031 is a deficient number, since it is larger than the sum of its proper divisors (211969).
11231320031 is a wasteful number, since it uses less digits than its factorization.
11231320031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211968.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11231320031 its reverse (13002313211), we get a palindrome (24233633242).
The spelling of 11231320031 in words is "eleven billion, two hundred thirty-one million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •