Base | Representation |
---|---|
bin | 10100011111010011… |
… | …01110000011100111 |
3 | 1001101121110120010001 |
4 | 22033221232003213 |
5 | 140012000404111 |
6 | 5015304242131 |
7 | 536406365560 |
oct | 121751560347 |
9 | 31347416101 |
10 | 11000013031 |
11 | 4735247667 |
12 | 216ba70347 |
13 | 1063c30567 |
14 | 764cb5167 |
15 | 445a931c1 |
hex | 28fa6e0e7 |
11000013031 has 16 divisors (see below), whose sum is σ = 12757409280. Its totient is φ = 9289294560.
The previous prime is 11000013019. The next prime is 11000013043. The reversal of 11000013031 is 13031000011.
It is an interprime number because it is at equal distance from previous prime (11000013019) and next prime (11000013043).
It is a de Polignac number, because none of the positive numbers 2k-11000013031 is a prime.
It is a super-2 number, since 2×110000130312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11000012999 and 11000013017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000013071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 786780 + ... + 800638.
It is an arithmetic number, because the mean of its divisors is an integer number (797338080).
Almost surely, 211000013031 is an apocalyptic number.
11000013031 is a deficient number, since it is larger than the sum of its proper divisors (1757396249).
11000013031 is a wasteful number, since it uses less digits than its factorization.
11000013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15534.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 11000013031 its reverse (13031000011), we get a palindrome (24031013042).
The spelling of 11000013031 in words is "eleven billion, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •