Base | Representation |
---|---|
bin | 1001001101011110… |
… | …0011010111000101 |
3 | 20101022022012100122 |
4 | 2103113203113011 |
5 | 20030420044101 |
6 | 1045200351325 |
7 | 115161156602 |
oct | 22327432705 |
9 | 6338265318 |
10 | 2472424901 |
11 | 105968a471 |
12 | 590015545 |
13 | 3052c611b |
14 | 1965136a9 |
15 | e70d051b |
hex | 935e35c5 |
2472424901 has 2 divisors, whose sum is σ = 2472424902. Its totient is φ = 2472424900.
The previous prime is 2472424847. The next prime is 2472424907. The reversal of 2472424901 is 1094242742.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2406393025 + 66031876 = 49055^2 + 8126^2 .
It is a cyclic number.
It is not a de Polignac number, because 2472424901 - 214 = 2472408517 is a prime.
It is a super-2 number, since 2×24724249012 = 12225769782169719602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2472424907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1236212450 + 1236212451.
It is an arithmetic number, because the mean of its divisors is an integer number (1236212451).
Almost surely, 22472424901 is an apocalyptic number.
It is an amenable number.
2472424901 is a deficient number, since it is larger than the sum of its proper divisors (1).
2472424901 is an equidigital number, since it uses as much as digits as its factorization.
2472424901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 35.
The square root of 2472424901 is about 49723.4844012364. The cubic root of 2472424901 is about 1352.2003260242.
The spelling of 2472424901 in words is "two billion, four hundred seventy-two million, four hundred twenty-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •