Base | Representation |
---|---|
bin | 100010010001000101000010… |
… | …0110000001000110001000101 |
3 | 1110112012221100201022120211201 |
4 | 1010202022010300020301011 |
5 | 304001333234140010041 |
6 | 2545015514431302501 |
7 | 120326321601154132 |
oct | 10442120460106105 |
9 | 1415187321276751 |
10 | 301414442110021 |
11 | 88049168792829 |
12 | 2998017a97aa31 |
13 | cc2534c0b4206 |
14 | 5460773121589 |
15 | 24ca734832631 |
hex | 1122284c08c45 |
301414442110021 has 8 divisors (see below), whose sum is σ = 308766270492288. Its totient is φ = 294062625948000.
The previous prime is 301414442109997. The next prime is 301414442110037. The reversal of 301414442110021 is 120011244414103.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 301414442110021 - 29 = 301414442109509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301414442110921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65308366 + ... + 69771136.
It is an arithmetic number, because the mean of its divisors is an integer number (38595783811536).
Almost surely, 2301414442110021 is an apocalyptic number.
It is an amenable number.
301414442110021 is a deficient number, since it is larger than the sum of its proper divisors (7351828382267).
301414442110021 is a wasteful number, since it uses less digits than its factorization.
301414442110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6110123.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 301414442110021 its reverse (120011244414103), we get a palindrome (421425686524124).
The spelling of 301414442110021 in words is "three hundred one trillion, four hundred fourteen billion, four hundred forty-two million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •