Base | Representation |
---|---|
bin | 1110011000001100101… |
… | …00100111101000101100 |
3 | 1202020011121112111111120 |
4 | 13030012110213220230 |
5 | 31043231442320224 |
6 | 1014541503420540 |
7 | 50456312554020 |
oct | 7140624475054 |
9 | 1666147474446 |
10 | 494027307564 |
11 | 18057459924a |
12 | 7b8b48b4750 |
13 | 3778192363b |
14 | 19ca7cc2380 |
15 | ccb65e1779 |
hex | 7306527a2c |
494027307564 has 96 divisors (see below), whose sum is σ = 1340275023360. Its totient is φ = 138702354432.
The previous prime is 494027307563. The next prime is 494027307583. The reversal of 494027307564 is 465703720494.
It is a happy number.
It is a super-2 number, since 2×4940273075642 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (494027307563) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13149334 + ... + 13186850.
It is an arithmetic number, because the mean of its divisors is an integer number (13961198160).
Almost surely, 2494027307564 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 494027307564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (670137511680).
494027307564 is an abundant number, since it is smaller than the sum of its proper divisors (846247715796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
494027307564 is a wasteful number, since it uses less digits than its factorization.
494027307564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40247 (or 40245 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 51.
The spelling of 494027307564 in words is "four hundred ninety-four billion, twenty-seven million, three hundred seven thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •