Base | Representation |
---|---|
bin | 10101100110110001… |
… | …00011000001001101 |
3 | 1002221101111012111022 |
4 | 22303120203001031 |
5 | 142223432204044 |
6 | 5155001203525 |
7 | 560306022311 |
oct | 126330430115 |
9 | 32841435438 |
10 | 11599491149 |
11 | 4a12679424 |
12 | 22b87905a5 |
13 | 112b1a573c |
14 | 7c0763b41 |
15 | 47d50b3ee |
hex | 2b362304d |
11599491149 has 2 divisors, whose sum is σ = 11599491150. Its totient is φ = 11599491148.
The previous prime is 11599491143. The next prime is 11599491193. The reversal of 11599491149 is 94119499511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9142801924 + 2456689225 = 95618^2 + 49565^2 .
It is a cyclic number.
It is not a de Polignac number, because 11599491149 - 216 = 11599425613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11599491149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11599491143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5799745574 + 5799745575.
It is an arithmetic number, because the mean of its divisors is an integer number (5799745575).
Almost surely, 211599491149 is an apocalyptic number.
It is an amenable number.
11599491149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11599491149 is an equidigital number, since it uses as much as digits as its factorization.
11599491149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 524880, while the sum is 53.
The spelling of 11599491149 in words is "eleven billion, five hundred ninety-nine million, four hundred ninety-one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •