Base | Representation |
---|---|
bin | 10100100001000010… |
… | …00110010100011011 |
3 | 1001102121210010002211 |
4 | 22100201012110123 |
5 | 140024204432311 |
6 | 5020543335551 |
7 | 536643651220 |
oct | 122041062433 |
9 | 31377703084 |
10 | 11014530331 |
11 | 4742462732 |
12 | 21748b15b7 |
13 | 1066c4428c |
14 | 766bb3947 |
15 | 446eae821 |
hex | 29084651b |
11014530331 has 32 divisors (see below), whose sum is σ = 13113446400. Its totient is φ = 9056810880.
The previous prime is 11014530313. The next prime is 11014530383. The reversal of 11014530331 is 13303541011.
It is a cyclic number.
It is not a de Polignac number, because 11014530331 - 27 = 11014530203 is a prime.
It is a super-2 number, since 2×110145303312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11014530301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4049590 + ... + 4052308.
It is an arithmetic number, because the mean of its divisors is an integer number (409795200).
Almost surely, 211014530331 is an apocalyptic number.
11014530331 is a deficient number, since it is larger than the sum of its proper divisors (2098916069).
11014530331 is a wasteful number, since it uses less digits than its factorization.
11014530331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3019.
The product of its (nonzero) digits is 540, while the sum is 22.
The spelling of 11014530331 in words is "eleven billion, fourteen million, five hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •