Base | Representation |
---|---|
bin | 111101001000000111000… |
… | …0111010100010011011000 |
3 | 1002202010221120110211020020 |
4 | 1322100032013110103120 |
5 | 2100121120331031133 |
6 | 25511242114430440 |
7 | 1524652250544225 |
oct | 172201607242330 |
9 | 32663846424206 |
10 | 8401192830168 |
11 | 2749a20374596 |
12 | b3825a592420 |
13 | 48c2c93b6368 |
14 | 21089702694c |
15 | e88034300b3 |
hex | 7a40e1d44d8 |
8401192830168 has 64 divisors (see below), whose sum is σ = 21681003801600. Its totient is φ = 2709998931840.
The previous prime is 8401192830157. The next prime is 8401192830179. The reversal of 8401192830168 is 8610382911048.
It is an interprime number because it is at equal distance from previous prime (8401192830157) and next prime (8401192830179).
It is a self number, because there is not a number n which added to its sum of digits gives 8401192830168.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39936430 + ... + 40146242.
It is an arithmetic number, because the mean of its divisors is an integer number (338765684400).
Almost surely, 28401192830168 is an apocalyptic number.
It is an amenable number.
8401192830168 is an abundant number, since it is smaller than the sum of its proper divisors (13279810971432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8401192830168 is a wasteful number, since it uses less digits than its factorization.
8401192830168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263672 (or 263668 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 51.
The spelling of 8401192830168 in words is "eight trillion, four hundred one billion, one hundred ninety-two million, eight hundred thirty thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •