Base | Representation |
---|---|
bin | 10100110111010100… |
… | …10110101100000011 |
3 | 1001220122121110120111 |
4 | 22123222112230003 |
5 | 140420041143201 |
6 | 5051303052151 |
7 | 544404142021 |
oct | 123352265403 |
9 | 31818543514 |
10 | 11201506051 |
11 | 4828a5a31a |
12 | 2207441057 |
13 | 10968bb2b8 |
14 | 783965711 |
15 | 4585e4b51 |
hex | 29ba96b03 |
11201506051 has 2 divisors, whose sum is σ = 11201506052. Its totient is φ = 11201506050.
The previous prime is 11201506049. The next prime is 11201506073. The reversal of 11201506051 is 15060510211.
It is a happy number.
11201506051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (11201506073) can be obtained adding 11201506051 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11201506051 - 21 = 11201506049 is a prime.
It is a super-2 number, since 2×112015060512 (a number of 21 digits) contains 22 as substring.
Together with 11201506049, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11201506021) 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, 5600753025 + 5600753026.
It is an arithmetic number, because the mean of its divisors is an integer number (5600753026).
Almost surely, 211201506051 is an apocalyptic number.
11201506051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201506051 is an equidigital number, since it uses as much as digits as its factorization.
11201506051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 22.
The spelling of 11201506051 in words is "eleven billion, two hundred one million, five hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •