Base | Representation |
---|---|
bin | 11101001101011… |
… | …011100100000000 |
3 | 1021011010121222120 |
4 | 131031123210000 |
5 | 2000423410112 |
6 | 120343404240 |
7 | 15100304310 |
oct | 3515334400 |
9 | 1234117876 |
10 | 490060032 |
11 | 2316983a0 |
12 | 118153680 |
13 | 7a6b4967 |
14 | 49129440 |
15 | 2d052e8c |
hex | 1d35b900 |
490060032 has 144 divisors (see below), whose sum is σ = 1626304512. Its totient is φ = 127272960.
The previous prime is 490059961. The next prime is 490060061. The reversal of 490060032 is 230060094.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 490059984 and 490060011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54993 + ... + 63279.
Almost surely, 2490060032 is an apocalyptic number.
490060032 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 490060032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (813152256).
490060032 is an abundant number, since it is smaller than the sum of its proper divisors (1136244480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
490060032 is a wasteful number, since it uses less digits than its factorization.
490060032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8324 (or 8310 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 490060032 is about 22137.2995643100. The cubic root of 490060032 is about 788.4057106685.
The spelling of 490060032 in words is "four hundred ninety million, sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •