Base | Representation |
---|---|
bin | 100010101011101101110… |
… | …1101010000000111110000 |
3 | 121212200221211012202202001 |
4 | 1011113123231100013300 |
5 | 1111044404012212310 |
6 | 14045501230103344 |
7 | 1001250603205234 |
oct | 105273355200760 |
9 | 17780854182661 |
10 | 4766804804080 |
11 | 1578655050350 |
12 | 64ba0934ab54 |
13 | 28767a734037 |
14 | 126a00b625c4 |
15 | 83ededc393a |
hex | 455dbb501f0 |
4766804804080 has 40 divisors (see below), whose sum is σ = 12090350368944. Its totient is φ = 1733383564800.
The previous prime is 4766804804077. The next prime is 4766804804089. The reversal of 4766804804080 is 804084086674.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4766804804089) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2708410941 + ... + 2708412700.
Almost surely, 24766804804080 is an apocalyptic number.
4766804804080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4766804804080 is an abundant number, since it is smaller than the sum of its proper divisors (7323545564864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4766804804080 is a wasteful number, since it uses less digits than its factorization.
4766804804080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5416823665 (or 5416823659 counting only the distinct ones).
The product of its (nonzero) digits is 8257536, while the sum is 55.
The spelling of 4766804804080 in words is "four trillion, seven hundred sixty-six billion, eight hundred four million, eight hundred four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •