Base | Representation |
---|---|
bin | 100111110000011000… |
… | …010001100101000110 |
3 | 11002011222020210221000 |
4 | 213300120101211012 |
5 | 1144411011212331 |
6 | 31335503234130 |
7 | 3040560423063 |
oct | 476030214506 |
9 | 132158223830 |
10 | 42687600966 |
11 | 1711604646a |
12 | 8333ba8946 |
13 | 4043b174aa |
14 | 20cd4d3c6a |
15 | 119c91d0e6 |
hex | 9f0611946 |
42687600966 has 64 divisors (see below), whose sum is σ = 97982668800. Its totient is φ = 13761576000.
The previous prime is 42687600929. The next prime is 42687600971. The reversal of 42687600966 is 66900678624.
42687600966 is a `hidden beast` number, since 4 + 26 + 8 + 7 + 600 + 9 + 6 + 6 = 666.
It is a super-3 number, since 3×426876009663 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3007795 + ... + 3021953.
It is an arithmetic number, because the mean of its divisors is an integer number (1530979200).
Almost surely, 242687600966 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42687600966, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48991334400).
42687600966 is an abundant number, since it is smaller than the sum of its proper divisors (55295067834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42687600966 is a wasteful number, since it uses less digits than its factorization.
42687600966 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16002 (or 15996 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 54.
The spelling of 42687600966 in words is "forty-two billion, six hundred eighty-seven million, six hundred thousand, nine hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •