Base | Representation |
---|---|
bin | 1000010110011010… |
… | …01101100110011011 |
3 | 102120102111222210121 |
4 | 10023031031212123 |
5 | 33140120332001 |
6 | 2020501454111 |
7 | 216043463161 |
oct | 41315154633 |
9 | 12512458717 |
10 | 4482980251 |
11 | 19a0586462 |
12 | a51411337 |
13 | 5659c7a49 |
14 | 307559231 |
15 | 1b387a6a1 |
hex | 10b34d99b |
4482980251 has 12 divisors (see below), whose sum is σ = 4790500680. Its totient is φ = 4183565760.
The previous prime is 4482980237. The next prime is 4482980263. The reversal of 4482980251 is 1520892844.
It is not a de Polignac number, because 4482980251 - 27 = 4482980123 is a prime.
It is a super-2 number, since 2×44829802512 = 40194223861712046002, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4482980198 and 4482980207.
It is not an unprimeable number, because it can be changed into a prime (4482980651) 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 in 11 ways as a sum of consecutive naturals, for example, 59011 + ... + 111571.
It is an arithmetic number, because the mean of its divisors is an integer number (399208390).
Almost surely, 24482980251 is an apocalyptic number.
4482980251 is a deficient number, since it is larger than the sum of its proper divisors (307520429).
4482980251 is an equidigital number, since it uses as much as digits as its factorization.
4482980251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52714 (or 52647 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 43.
The square root of 4482980251 is about 66955.0614292900. The cubic root of 4482980251 is about 1648.8795884374.
The spelling of 4482980251 in words is "four billion, four hundred eighty-two million, nine hundred eighty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •