Base | Representation |
---|---|
bin | 1000110110110100110… |
… | …10100010010010110110 |
3 | 1002002111000220101221100 |
4 | 10123122122202102312 |
5 | 14441212344200042 |
6 | 351444332230530 |
7 | 30662065112460 |
oct | 4333232422266 |
9 | 1062430811840 |
10 | 304312100022 |
11 | 108070279927 |
12 | 4ab8960b446 |
13 | 229092c6798 |
14 | 10a2bad9130 |
15 | 7db103324c |
hex | 46da6a24b6 |
304312100022 has 96 divisors (see below), whose sum is σ = 817320538944. Its totient is φ = 79835904000.
The previous prime is 304312100017. The next prime is 304312100089. The reversal of 304312100022 is 220001213403.
304312100022 is a `hidden beast` number, since 3 + 0 + 431 + 210 + 0 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 304312099968 and 304312100004.
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 47 ways as a sum of consecutive naturals, for example, 1644729 + ... + 1820372.
It is an arithmetic number, because the mean of its divisors is an integer number (8513755614).
Almost surely, 2304312100022 is an apocalyptic number.
304312100022 is an abundant number, since it is smaller than the sum of its proper divisors (513008438922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304312100022 is a wasteful number, since it uses less digits than its factorization.
304312100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3465174 (or 3465171 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 304312100022 its reverse (220001213403), we get a palindrome (524313313425).
The spelling of 304312100022 in words is "three hundred four billion, three hundred twelve million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •