Base | Representation |
---|---|
bin | 11101101101011… |
… | …111011001110100 |
3 | 1021201221121120102 |
4 | 131231133121310 |
5 | 2010101324442 |
6 | 121243453232 |
7 | 15231606620 |
oct | 3555373164 |
9 | 1251847512 |
10 | 498464372 |
11 | 23640872a |
12 | 11ab27218 |
13 | 7c368143 |
14 | 4a2b6180 |
15 | 2db63232 |
hex | 1db5f674 |
498464372 has 48 divisors (see below), whose sum is σ = 1045820160. Its totient is φ = 203250432.
The previous prime is 498464363. The next prime is 498464377. The reversal of 498464372 is 273464894.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (498464377) 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 15 ways as a sum of consecutive naturals, for example, 124904 + ... + 128832.
It is an arithmetic number, because the mean of its divisors is an integer number (21787920).
Almost surely, 2498464372 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 498464372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (522910080).
498464372 is an abundant number, since it is smaller than the sum of its proper divisors (547355788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
498464372 is a wasteful number, since it uses less digits than its factorization.
498464372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4160 (or 4158 counting only the distinct ones).
The product of its digits is 1161216, while the sum is 47.
The square root of 498464372 is about 22326.3156835157. The cubic root of 498464372 is about 792.8871402087.
The spelling of 498464372 in words is "four hundred ninety-eight million, four hundred sixty-four thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •