Base | Representation |
---|---|
bin | 1001001101101101… |
… | …0100011110001001 |
3 | 20101101011101001222 |
4 | 2103123110132021 |
5 | 20031143144424 |
6 | 1045233451425 |
7 | 115202442062 |
oct | 22333243611 |
9 | 6341141058 |
10 | 2473412489 |
11 | 105a1a4459 |
12 | 590410b75 |
13 | 3055807b2 |
14 | 1966cd569 |
15 | e7227e5e |
hex | 936d4789 |
2473412489 has 2 divisors, whose sum is σ = 2473412490. Its totient is φ = 2473412488.
The previous prime is 2473412429. The next prime is 2473412509. The reversal of 2473412489 is 9842143742.
2473412489 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., 2436409600 + 37002889 = 49360^2 + 6083^2 .
It is a cyclic number.
It is not a de Polignac number, because 2473412489 - 220 = 2472363913 is a prime.
It is a super-2 number, since 2×24734124892 = 12235538681482350242, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2473412429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1236706244 + 1236706245.
It is an arithmetic number, because the mean of its divisors is an integer number (1236706245).
Almost surely, 22473412489 is an apocalyptic number.
It is an amenable number.
2473412489 is a deficient number, since it is larger than the sum of its proper divisors (1).
2473412489 is an equidigital number, since it uses as much as digits as its factorization.
2473412489 is an evil number, because the sum of its binary digits is even.
The product of its digits is 387072, while the sum is 44.
The square root of 2473412489 is about 49733.4142101666. The cubic root of 2473412489 is about 1352.3803434971.
The spelling of 2473412489 in words is "two billion, four hundred seventy-three million, four hundred twelve thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •