Base | Representation |
---|---|
bin | 10101011011100100… |
… | …11100010100010011 |
3 | 1002200211211212012101 |
4 | 22231302130110103 |
5 | 142030414204042 |
6 | 5141405141231 |
7 | 555056060254 |
oct | 125562342423 |
9 | 32624755171 |
10 | 11505616147 |
11 | 4974690783 |
12 | 229125a817 |
13 | 11148c7abc |
14 | 7b20c8b2b |
15 | 4751666b7 |
hex | 2adc9c513 |
11505616147 has 2 divisors, whose sum is σ = 11505616148. Its totient is φ = 11505616146.
The previous prime is 11505616061. The next prime is 11505616151. The reversal of 11505616147 is 74161650511.
11505616147 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 not a de Polignac number, because 11505616147 - 227 = 11371398419 is a prime.
It is not a weakly prime, because it can be changed into another prime (11505616747) 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, 5752808073 + 5752808074.
It is an arithmetic number, because the mean of its divisors is an integer number (5752808074).
Almost surely, 211505616147 is an apocalyptic number.
11505616147 is a deficient number, since it is larger than the sum of its proper divisors (1).
11505616147 is an equidigital number, since it uses as much as digits as its factorization.
11505616147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 37.
The spelling of 11505616147 in words is "eleven billion, five hundred five million, six hundred sixteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •