Base | Representation |
---|---|
bin | 11011110010000… |
… | …110000000100100 |
3 | 1012111002011211102 |
4 | 123302012000210 |
5 | 1423311213034 |
6 | 114130255232 |
7 | 14356632440 |
oct | 3362060044 |
9 | 1174064742 |
10 | 466116644 |
11 | 21a124374 |
12 | 110127518 |
13 | 75750686 |
14 | 45c95820 |
15 | 2adc397e |
hex | 1bc86024 |
466116644 has 12 divisors (see below), whose sum is σ = 932233344. Its totient is φ = 199764264.
The previous prime is 466116613. The next prime is 466116647. The reversal of 466116644 is 446611664.
466116644 is an admirable number.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 466116598 and 466116607.
It is not an unprimeable number, because it can be changed into a prime (466116647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8323484 + ... + 8323539.
It is an arithmetic number, because the mean of its divisors is an integer number (77686112).
Almost surely, 2466116644 is an apocalyptic number.
It is an amenable number.
466116644 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
466116644 is a wasteful number, since it uses less digits than its factorization.
466116644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16647034 (or 16647032 counting only the distinct ones).
The product of its digits is 82944, while the sum is 38.
The square root of 466116644 is about 21589.7346903569. The cubic root of 466116644 is about 775.3507362857.
The spelling of 466116644 in words is "four hundred sixty-six million, one hundred sixteen thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •