Base | Representation |
---|---|
bin | 10110000011110000… |
… | …01011011011011001 |
3 | 1010120100001200010212 |
4 | 23001320023123121 |
5 | 143223210223103 |
6 | 5235045220505 |
7 | 566320661435 |
oct | 130170133331 |
9 | 33510050125 |
10 | 11842664153 |
11 | 5027969951 |
12 | 2366101735 |
13 | 11696978a8 |
14 | 804b839c5 |
15 | 494a427d8 |
hex | 2c1e0b6d9 |
11842664153 has 2 divisors, whose sum is σ = 11842664154. Its totient is φ = 11842664152.
The previous prime is 11842664101. The next prime is 11842664167. The reversal of 11842664153 is 35146624811.
11842664153 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 can be written as a sum of positive squares in only one way, i.e., 11636368384 + 206295769 = 107872^2 + 14363^2 .
It is a cyclic number.
It is not a de Polignac number, because 11842664153 - 28 = 11842663897 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11842664153.
It is not a weakly prime, because it can be changed into another prime (11842664173) 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, 5921332076 + 5921332077.
It is an arithmetic number, because the mean of its divisors is an integer number (5921332077).
Almost surely, 211842664153 is an apocalyptic number.
It is an amenable number.
11842664153 is a deficient number, since it is larger than the sum of its proper divisors (1).
11842664153 is an equidigital number, since it uses as much as digits as its factorization.
11842664153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 138240, while the sum is 41.
The spelling of 11842664153 in words is "eleven billion, eight hundred forty-two million, six hundred sixty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •