Base | Representation |
---|---|
bin | 1011101000110100… |
… | …1000010100111001 |
3 | 22001201100212001112 |
4 | 2322031020110321 |
5 | 22344221113103 |
6 | 1233554130105 |
7 | 140262411554 |
oct | 27215102471 |
9 | 8051325045 |
10 | 3124004153 |
11 | 1363467616 |
12 | 732280935 |
13 | 3aa2b0b8a |
14 | 218c8569b |
15 | 1343dacd8 |
hex | ba348539 |
3124004153 has 2 divisors, whose sum is σ = 3124004154. Its totient is φ = 3124004152.
The previous prime is 3124004113. The next prime is 3124004161. The reversal of 3124004153 is 3514004213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2992855849 + 131148304 = 54707^2 + 11452^2 .
It is an emirp because it is prime and its reverse (3514004213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3124004153 - 26 = 3124004089 is a prime.
It is a super-2 number, since 2×31240041532 = 19518803895922494818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3124004113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1562002076 + 1562002077.
It is an arithmetic number, because the mean of its divisors is an integer number (1562002077).
Almost surely, 23124004153 is an apocalyptic number.
It is an amenable number.
3124004153 is a deficient number, since it is larger than the sum of its proper divisors (1).
3124004153 is an equidigital number, since it uses as much as digits as its factorization.
3124004153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 3124004153 is about 55892.7916014221. The cubic root of 3124004153 is about 1461.8535526447.
Adding to 3124004153 its reverse (3514004213), we get a palindrome (6638008366).
The spelling of 3124004153 in words is "three billion, one hundred twenty-four million, four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •