Base | Representation |
---|---|
bin | 1110011010001101111… |
… | …11101111100000000000 |
3 | 1202022222020020120002220 |
4 | 13031012333233200000 |
5 | 31102442230310132 |
6 | 1015241304011040 |
7 | 50525226366060 |
oct | 7150677574000 |
9 | 1668866216086 |
10 | 495112353792 |
11 | 180a8101a571 |
12 | 7bb58160a80 |
13 | 378c5669a24 |
14 | 19d6c04b3a0 |
15 | cd2b9c1a2c |
hex | 7346fef800 |
495112353792 has 192 divisors, whose sum is σ = 1509939325440. Its totient is φ = 141329989632.
The previous prime is 495112353739. The next prime is 495112353839. The reversal of 495112353792 is 297353211594.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52594078 + ... + 52603490.
It is an arithmetic number, because the mean of its divisors is an integer number (7864267320).
Almost surely, 2495112353792 is an apocalyptic number.
495112353792 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 495112353792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (754969662720).
495112353792 is an abundant number, since it is smaller than the sum of its proper divisors (1014826971648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495112353792 is a wasteful number, since it uses less digits than its factorization.
495112353792 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10668 (or 10648 counting only the distinct ones).
The product of its digits is 2041200, while the sum is 51.
The spelling of 495112353792 in words is "four hundred ninety-five billion, one hundred twelve million, three hundred fifty-three thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •