Base | Representation |
---|---|
bin | 100010101011011010001… |
… | …1110011001110001101000 |
3 | 121212122020221200112112122 |
4 | 1011112310132121301220 |
5 | 1111042032012200130 |
6 | 14045312034330412 |
7 | 1001225361442100 |
oct | 105266436316150 |
9 | 17778227615478 |
10 | 4766146600040 |
11 | 1578347558971 |
12 | 64b864a29a08 |
13 | 2875a4269aa7 |
14 | 12697b588200 |
15 | 83ea220a2e5 |
hex | 455b4799c68 |
4766146600040 has 96 divisors (see below), whose sum is σ = 12904820029800. Its totient is φ = 1577758855680.
The previous prime is 4766146600013. The next prime is 4766146600067. The reversal of 4766146600040 is 400066416674.
It is an interprime number because it is at equal distance from previous prime (4766146600013) and next prime (4766146600067).
It can be written as a sum of positive squares in 4 ways, for example, as 3362580382756 + 1403566217284 = 1833734^2 + 1184722^2 .
It is a junction number, because it is equal to n+sod(n) for n = 4766146599964 and 4766146600000.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41869151 + ... + 41982830.
Almost surely, 24766146600040 is an apocalyptic number.
4766146600040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4766146600040 is an abundant number, since it is smaller than the sum of its proper divisors (8138673429760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4766146600040 is a wasteful number, since it uses less digits than its factorization.
4766146600040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83852035 (or 83852024 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 44.
The spelling of 4766146600040 in words is "four trillion, seven hundred sixty-six billion, one hundred forty-six million, six hundred thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •