Base | Representation |
---|---|
bin | 10101100111011010… |
… | …01001011111010001 |
3 | 1002221202122120112001 |
4 | 22303231021133101 |
5 | 142231323012401 |
6 | 5155313034001 |
7 | 560402644132 |
oct | 126355113721 |
9 | 32852576461 |
10 | 11604891601 |
11 | 4a15727906 |
12 | 22ba555901 |
13 | 112c346884 |
14 | 7c136bc89 |
15 | 47dc26601 |
hex | 2b3b497d1 |
11604891601 has 2 divisors, whose sum is σ = 11604891602. Its totient is φ = 11604891600.
The previous prime is 11604891581. The next prime is 11604891619. The reversal of 11604891601 is 10619840611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7301531601 + 4303360000 = 85449^2 + 65600^2 .
It is a cyclic number.
It is not a de Polignac number, because 11604891601 - 217 = 11604760529 is a prime.
It is not a weakly prime, because it can be changed into another prime (11604898601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5802445800 + 5802445801.
It is an arithmetic number, because the mean of its divisors is an integer number (5802445801).
Almost surely, 211604891601 is an apocalyptic number.
It is an amenable number.
11604891601 is a deficient number, since it is larger than the sum of its proper divisors (1).
11604891601 is an equidigital number, since it uses as much as digits as its factorization.
11604891601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 37.
The spelling of 11604891601 in words is "eleven billion, six hundred four million, eight hundred ninety-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •