Base | Representation |
---|---|
bin | 1011001000101110… |
… | …0111101011010111 |
3 | 21201100001202220120 |
4 | 2302023213223113 |
5 | 22110240444201 |
6 | 1212345003023 |
7 | 134036254230 |
oct | 26213475327 |
9 | 7640052816 |
10 | 2989390551 |
11 | 12a4484404 |
12 | 6b5183473 |
13 | 38843b464 |
14 | 205044087 |
15 | 12769a536 |
hex | b22e7ad7 |
2989390551 has 32 divisors (see below), whose sum is σ = 4826562048. Its totient is φ = 1606625280.
The previous prime is 2989390541. The next prime is 2989390589. The reversal of 2989390551 is 1550939892.
It is not a de Polignac number, because 2989390551 - 27 = 2989390423 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 2989390494 and 2989390503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2989390501) 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 in 31 ways as a sum of consecutive naturals, for example, 956271 + ... + 959391.
It is an arithmetic number, because the mean of its divisors is an integer number (150830064).
Almost surely, 22989390551 is an apocalyptic number.
2989390551 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2989390551 is a deficient number, since it is larger than the sum of its proper divisors (1837171497).
2989390551 is a wasteful number, since it uses less digits than its factorization.
2989390551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5831.
The product of its (nonzero) digits is 874800, while the sum is 51.
The square root of 2989390551 is about 54675.3193955006. The cubic root of 2989390551 is about 1440.5473984647.
The spelling of 2989390551 in words is "two billion, nine hundred eighty-nine million, three hundred ninety thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •