Base | Representation |
---|---|
bin | 10100100011001110… |
… | …01101011010001011 |
3 | 1001110220100212111222 |
4 | 22101213031122023 |
5 | 140043411100301 |
6 | 5022441312255 |
7 | 540256116524 |
oct | 122147153213 |
9 | 31426325458 |
10 | 11032909451 |
11 | 4751876193 |
12 | 217aa9568b |
13 | 106a9aa9b5 |
14 | 7693d984b |
15 | 4488e031b |
hex | 2919cd68b |
11032909451 has 2 divisors, whose sum is σ = 11032909452. Its totient is φ = 11032909450.
The previous prime is 11032909397. The next prime is 11032909469. The reversal of 11032909451 is 15490923011.
It is a happy number.
11032909451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11032909451 is a prime.
It is not a weakly prime, because it can be changed into another prime (11032909351) 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 as a sum of consecutive naturals, namely, 5516454725 + 5516454726.
It is an arithmetic number, because the mean of its divisors is an integer number (5516454726).
Almost surely, 211032909451 is an apocalyptic number.
11032909451 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032909451 is an equidigital number, since it uses as much as digits as its factorization.
11032909451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 35.
The spelling of 11032909451 in words is "eleven billion, thirty-two million, nine hundred nine thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •