Base | Representation |
---|---|
bin | 101101101000111111… |
… | …010011000000110001 |
3 | 11200111022112222022000 |
4 | 231220333103000301 |
5 | 1300331023014130 |
6 | 34302454004213 |
7 | 3353262445116 |
oct | 555077230061 |
9 | 150438488260 |
10 | 49006063665 |
11 | 19868710a69 |
12 | 95b8046669 |
13 | 480cb76810 |
14 | 252c72090d |
15 | 141c4b0260 |
hex | b68fd3031 |
49006063665 has 64 divisors (see below), whose sum is σ = 94700793600. Its totient is φ = 23900493312.
The previous prime is 49006063621. The next prime is 49006063697. The reversal of 49006063665 is 56636060094.
49006063665 is a `hidden beast` number, since 4 + 9 + 0 + 0 + 6 + 0 + 636 + 6 + 5 = 666.
49006063665 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 49006063665 - 212 = 49006059569 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 49006063665.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 57301 + ... + 318269.
It is an arithmetic number, because the mean of its divisors is an integer number (1479699900).
Almost surely, 249006063665 is an apocalyptic number.
49006063665 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
49006063665 is a deficient number, since it is larger than the sum of its proper divisors (45694729935).
49006063665 is a wasteful number, since it uses less digits than its factorization.
49006063665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261103 (or 261097 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 45.
The spelling of 49006063665 in words is "forty-nine billion, six million, sixty-three thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •