Base | Representation |
---|---|
bin | 100010100111111111101101… |
… | …1011011011101101111011000 |
3 | 1110221101001012022010010110011 |
4 | 1011033333123123131233120 |
5 | 304404434242434233124 |
6 | 2555430452552131304 |
7 | 121103013333643660 |
oct | 10517773333355730 |
9 | 1427331168103404 |
10 | 304564107336664 |
11 | 89052a0469245a |
12 | 2a1aa693396b34 |
13 | 100c336ca0bc06 |
14 | 552cda51431a0 |
15 | 2532628578994 |
hex | 114ffdb6ddbd8 |
304564107336664 has 64 divisors (see below), whose sum is σ = 675157310395200. Its totient is φ = 126023689741824.
The previous prime is 304564107336661. The next prime is 304564107336673. The reversal of 304564107336664 is 466633701465403.
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a junction number, because it is equal to n+sod(n) for n = 304564107336599 and 304564107336608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304564107336661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70817494 + ... + 74994970.
It is an arithmetic number, because the mean of its divisors is an integer number (10549332974925).
Almost surely, 2304564107336664 is an apocalyptic number.
It is an amenable number.
304564107336664 is an abundant number, since it is smaller than the sum of its proper divisors (370593203058536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304564107336664 is a wasteful number, since it uses less digits than its factorization.
304564107336664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4222412 (or 4222408 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 58.
The spelling of 304564107336664 in words is "three hundred four trillion, five hundred sixty-four billion, one hundred seven million, three hundred thirty-six thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •