Base | Representation |
---|---|
bin | 11101010111001… |
… | …001101001100100 |
3 | 1021022221002021110 |
4 | 131113021221210 |
5 | 2002101424400 |
6 | 120514145020 |
7 | 15131046135 |
oct | 3527115144 |
9 | 1238832243 |
10 | 492608100 |
11 | 233078836 |
12 | 118b82170 |
13 | 7b0976aa |
14 | 495cdc8c |
15 | 2d3a7e50 |
hex | 1d5c9a64 |
492608100 has 72 divisors (see below), whose sum is σ = 1432908288. Its totient is φ = 130659200.
The previous prime is 492608063. The next prime is 492608101. The reversal of 492608100 is 1806294.
It is a super-2 number, since 2×4926081002 = 485325480371220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (492608101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53002 + ... + 61598.
It is an arithmetic number, because the mean of its divisors is an integer number (19901504).
Almost surely, 2492608100 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 492608100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (716454144).
492608100 is an abundant number, since it is smaller than the sum of its proper divisors (940300188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
492608100 is a wasteful number, since it uses less digits than its factorization.
492608100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8805 (or 8798 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 492608100 is about 22194.7764124805. The cubic root of 492608100 is about 789.7697881793.
The spelling of 492608100 in words is "four hundred ninety-two million, six hundred eight thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •