Base | Representation |
---|---|
bin | 11100100111011010101… |
… | …111110001101011100000 |
3 | 20221222210200020221212110 |
4 | 130213122233301223200 |
5 | 224204312310332431 |
6 | 4103214524555320 |
7 | 262033650206625 |
oct | 34473257615340 |
9 | 6858720227773 |
10 | 1966470011616 |
11 | 698a80068290 |
12 | 2791469b2b40 |
13 | 11358ba63066 |
14 | 6b26b6bc34c |
15 | 36244521346 |
hex | 1c9dabf1ae0 |
1966470011616 has 96 divisors (see below), whose sum is σ = 5927636937600. Its totient is φ = 564536839680.
The previous prime is 1966470011581. The next prime is 1966470011621. The reversal of 1966470011616 is 6161100746691.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48984871 + ... + 49024998.
It is an arithmetic number, because the mean of its divisors is an integer number (61746218100).
Almost surely, 21966470011616 is an apocalyptic number.
1966470011616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1966470011616 is an abundant number, since it is smaller than the sum of its proper divisors (3961166925984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1966470011616 is a wasteful number, since it uses less digits than its factorization.
1966470011616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98009912 (or 98009904 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 1966470011616 in words is "one trillion, nine hundred sixty-six billion, four hundred seventy million, eleven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •