Base | Representation |
---|---|
bin | 10100011111010110… |
… | …10011111011111011 |
3 | 1001101122020202112121 |
4 | 22033223103323323 |
5 | 140012102232311 |
6 | 5015321222111 |
7 | 536413054312 |
oct | 121753237373 |
9 | 31348222477 |
10 | 11000430331 |
11 | 4735502140 |
12 | 2170031937 |
13 | 1064048497 |
14 | 764d83279 |
15 | 445b26b71 |
hex | 28fad3efb |
11000430331 has 4 divisors (see below), whose sum is σ = 12000469464. Its totient is φ = 10000391200.
The previous prime is 11000430313. The next prime is 11000430347. The reversal of 11000430331 is 13303400011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000430331 is a prime.
It is a super-2 number, since 2×110004303312 (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 (11000430391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500019550 + ... + 500019571.
It is an arithmetic number, because the mean of its divisors is an integer number (3000117366).
Almost surely, 211000430331 is an apocalyptic number.
11000430331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11000430331 is a deficient number, since it is larger than the sum of its proper divisors (1000039133).
11000430331 is a wasteful number, since it uses less digits than its factorization.
11000430331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000039132.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 11000430331 its reverse (13303400011), we get a palindrome (24303830342).
The spelling of 11000430331 in words is "eleven billion, four hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •