Base | Representation |
---|---|
bin | 100000101100000000110… |
… | …1110111101010010011100 |
3 | 120220111002120102002220000 |
4 | 1001120001232331102130 |
5 | 1042101233102102432 |
6 | 13315504504454300 |
7 | 642401642252415 |
oct | 101300156752234 |
9 | 16814076362800 |
10 | 4492564878492 |
11 | 1482316831249 |
12 | 606832a7a390 |
13 | 267854752b12 |
14 | 117626cdc80c |
15 | 7bcddec457c |
hex | 41601bbd49c |
4492564878492 has 30 divisors (see below), whose sum is σ = 11744452013448. Its totient is φ = 1497521626056.
The previous prime is 4492564878479. The next prime is 4492564878569. The reversal of 4492564878492 is 2948784652944.
4492564878492 is a `hidden beast` number, since 4 + 4 + 9 + 2 + 5 + 64 + 8 + 78 + 492 = 666.
It is a Smith number, since the sum of its digits (72) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 4492564878492.
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 9 ways as a sum of consecutive naturals, for example, 6932970168 + ... + 6932970815.
Almost surely, 24492564878492 is an apocalyptic number.
It is an amenable number.
4492564878492 is an abundant number, since it is smaller than the sum of its proper divisors (7251887134956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4492564878492 is a wasteful number, since it uses less digits than its factorization.
4492564878492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13865940999 (or 13865940988 counting only the distinct ones).
The product of its digits is 1114767360, while the sum is 72.
The spelling of 4492564878492 in words is "four trillion, four hundred ninety-two billion, five hundred sixty-four million, eight hundred seventy-eight thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •