Base | Representation |
---|---|
bin | 11101101010100… |
… | …011010100000000 |
3 | 1021200111110202100 |
4 | 131222203110000 |
5 | 2004402201302 |
6 | 121215150400 |
7 | 15222220530 |
oct | 3552432400 |
9 | 1250443670 |
10 | 497693952 |
11 | 235a31918 |
12 | 11a815400 |
13 | 7c158582 |
14 | 4a1554c0 |
15 | 2da5ed1c |
hex | 1daa3500 |
497693952 has 108 divisors (see below), whose sum is σ = 1640023840. Its totient is φ = 142193664.
The previous prime is 497693947. The next prime is 497693983. The reversal of 497693952 is 259396794.
497693952 is a `hidden beast` number, since 497 + 69 + 3 + 95 + 2 = 666.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 699 + ... + 31557.
Almost surely, 2497693952 is an apocalyptic number.
497693952 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 497693952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (820011920).
497693952 is an abundant number, since it is smaller than the sum of its proper divisors (1142329888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
497693952 is a wasteful number, since it uses less digits than its factorization.
497693952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30888 (or 30871 counting only the distinct ones).
The product of its digits is 3674160, while the sum is 54.
The square root of 497693952 is about 22309.0553811675. The cubic root of 497693952 is about 792.4784375840.
The spelling of 497693952 in words is "four hundred ninety-seven million, six hundred ninety-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •