Base | Representation |
---|---|
bin | 1001000010001001… |
… | …1101010010110101 |
3 | 20020222222022202122 |
4 | 2100202131102311 |
5 | 14431241430424 |
6 | 1040343045325 |
7 | 114043515605 |
oct | 22042352265 |
9 | 6228868678 |
10 | 2424951989 |
11 | 1034905359 |
12 | 578140845 |
13 | 2c8514045 |
14 | 1900b6c05 |
15 | e2d5445e |
hex | 9089d4b5 |
2424951989 has 2 divisors, whose sum is σ = 2424951990. Its totient is φ = 2424951988.
The previous prime is 2424951973. The next prime is 2424952043. The reversal of 2424951989 is 9891594242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2399530225 + 25421764 = 48985^2 + 5042^2 .
It is a cyclic number.
It is not a de Polignac number, because 2424951989 - 24 = 2424951973 is a prime.
It is a super-2 number, since 2×24249519892 = 11760784297910112242, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2424951989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2424951959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1212475994 + 1212475995.
It is an arithmetic number, because the mean of its divisors is an integer number (1212475995).
Almost surely, 22424951989 is an apocalyptic number.
It is an amenable number.
2424951989 is a deficient number, since it is larger than the sum of its proper divisors (1).
2424951989 is an equidigital number, since it uses as much as digits as its factorization.
2424951989 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1866240, while the sum is 53.
The square root of 2424951989 is about 49243.8015287203. The cubic root of 2424951989 is about 1343.4898246484.
The spelling of 2424951989 in words is "two billion, four hundred twenty-four million, nine hundred fifty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •