Base | Representation |
---|---|
bin | 10100101100110001… |
… | …10110001010110011 |
3 | 1001200111010102200200 |
4 | 22112120312022303 |
5 | 140224413432243 |
6 | 5034422450243 |
7 | 542251125213 |
oct | 122630661263 |
9 | 31614112620 |
10 | 11113030323 |
11 | 479301a18a |
12 | 21a1893983 |
13 | 10814810b5 |
14 | 775cd4243 |
15 | 450969ad3 |
hex | 2966362b3 |
11113030323 has 12 divisors (see below), whose sum is σ = 16074244368. Its totient is φ = 7398491760.
The previous prime is 11113030307. The next prime is 11113030337. The reversal of 11113030323 is 32303031111.
It is a happy number.
11113030323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11113030323 - 24 = 11113030307 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11113030296 and 11113030305.
It is not an unprimeable number, because it can be changed into a prime (11113030343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 842688 + ... + 855773.
It is an arithmetic number, because the mean of its divisors is an integer number (1339520364).
Almost surely, 211113030323 is an apocalyptic number.
11113030323 is a deficient number, since it is larger than the sum of its proper divisors (4961214045).
11113030323 is a wasteful number, since it uses less digits than its factorization.
11113030323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1699194 (or 1699191 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 11113030323 its reverse (32303031111), we get a palindrome (43416061434).
The spelling of 11113030323 in words is "eleven billion, one hundred thirteen million, thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •