Base | Representation |
---|---|
bin | 100100001010001010101… |
… | …0011011000011011011000 |
3 | 122121002111101012010211000 |
4 | 1020110111103120123120 |
5 | 1122410302422020200 |
6 | 14323004003505000 |
7 | 1022021114545464 |
oct | 110242523303330 |
9 | 18532441163730 |
10 | 4969634563800 |
11 | 1646679175945 |
12 | 683194688160 |
13 | 2a083309cc3a |
14 | 1327629b34a4 |
15 | 894119b0300 |
hex | 485154d86d8 |
4969634563800 has 96 divisors (see below), whose sum is σ = 17117630182800. Its totient is φ = 1325235882240.
The previous prime is 4969634563787. The next prime is 4969634563807. The reversal of 4969634563800 is 83654369694.
It is a happy number.
4969634563800 is a `hidden beast` number, since 4 + 9 + 6 + 9 + 63 + 4 + 563 + 8 + 0 + 0 = 666.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4969634563807) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 460145949 + ... + 460156748.
Almost surely, 24969634563800 is an apocalyptic number.
4969634563800 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4969634563800 is an abundant number, since it is smaller than the sum of its proper divisors (12147995619000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4969634563800 is a wasteful number, since it uses less digits than its factorization.
4969634563800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 920302722 (or 920302707 counting only the distinct ones).
The product of its (nonzero) digits is 100776960, while the sum is 63.
The spelling of 4969634563800 in words is "four trillion, nine hundred sixty-nine billion, six hundred thirty-four million, five hundred sixty-three thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •