Base | Representation |
---|---|
bin | 1011001101111001… |
… | …1100110110011001 |
3 | 21202211220221101001 |
4 | 2303132130312121 |
5 | 22131320313103 |
6 | 1214442225001 |
7 | 134421651211 |
oct | 26336346631 |
9 | 7684827331 |
10 | 3011104153 |
11 | 1305765132 |
12 | 7004b5161 |
13 | 38caa1845 |
14 | 207c97241 |
15 | 12953901d |
hex | b379cd99 |
3011104153 has 2 divisors, whose sum is σ = 3011104154. Its totient is φ = 3011104152.
The previous prime is 3011104093. The next prime is 3011104157. The reversal of 3011104153 is 3514011103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2740731904 + 270372249 = 52352^2 + 16443^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3011104153 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3011104153.
It is not a weakly prime, because it can be changed into another prime (3011104157) 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, 1505552076 + 1505552077.
It is an arithmetic number, because the mean of its divisors is an integer number (1505552077).
Almost surely, 23011104153 is an apocalyptic number.
It is an amenable number.
3011104153 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011104153 is an equidigital number, since it uses as much as digits as its factorization.
3011104153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 3011104153 is about 54873.5287092055. The cubic root of 3011104153 is about 1444.0268193352.
Adding to 3011104153 its reverse (3514011103), we get a palindrome (6525115256).
The spelling of 3011104153 in words is "three billion, eleven million, one hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •