Base | Representation |
---|---|
bin | 11011111011110… |
… | …001011110000000 |
3 | 1012122212002100210 |
4 | 123323301132000 |
5 | 1424433411302 |
6 | 114300514120 |
7 | 14420331024 |
oct | 3373613600 |
9 | 1178762323 |
10 | 468653952 |
11 | 2205a7718 |
12 | 110b4b940 |
13 | 7612b540 |
14 | 46356384 |
15 | 2b22566c |
hex | 1bef1780 |
468653952 has 128 divisors (see below), whose sum is σ = 1349460000. Its totient is φ = 143253504.
The previous prime is 468653923. The next prime is 468653953. The reversal of 468653952 is 259356864.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (48).
Its product of digits (1555200) is a multiple of the sum of its prime factors (648).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (468653953) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1342674 + ... + 1343022.
Almost surely, 2468653952 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 468653952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (674730000).
468653952 is an abundant number, since it is smaller than the sum of its proper divisors (880806048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
468653952 is a wasteful number, since it uses less digits than its factorization.
468653952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 648 (or 636 counting only the distinct ones).
The product of its digits is 1555200, while the sum is 48.
The square root of 468653952 is about 21648.4168474279. The cubic root of 468653952 is about 776.7550662478.
The spelling of 468653952 in words is "four hundred sixty-eight million, six hundred fifty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •