Base | Representation |
---|---|
bin | 100010010000010110000000… |
… | …0000110010101010101010001 |
3 | 1110111212021122011120010220202 |
4 | 1010200230000012111111101 |
5 | 303443204402132423441 |
6 | 2544501251352544545 |
7 | 120316114513063406 |
oct | 10440540006252521 |
9 | 1414767564503822 |
10 | 301313432311121 |
11 | 8800a34435088a |
12 | 2996468a9b2155 |
13 | cc18972316439 |
14 | 545990dd222ad |
15 | 24c7cc1b2d19b |
hex | 1120b00195551 |
301313432311121 has 32 divisors (see below), whose sum is σ = 334971044352000. Its totient is φ = 269581641809920.
The previous prime is 301313432311069. The next prime is 301313432311181. The reversal of 301313432311121 is 121113234313103.
It is a cyclic number.
It is not a de Polignac number, because 301313432311121 - 210 = 301313432310097 is a prime.
It is a super-2 number, since 2×3013134323111212 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (301313432311181) 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, 76417265 + ... + 80263473.
It is an arithmetic number, because the mean of its divisors is an integer number (10467845136000).
Almost surely, 2301313432311121 is an apocalyptic number.
It is an amenable number.
301313432311121 is a deficient number, since it is larger than the sum of its proper divisors (33657612040879).
301313432311121 is a wasteful number, since it uses less digits than its factorization.
301313432311121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3847489.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 301313432311121 its reverse (121113234313103), we get a palindrome (422426666624224).
The spelling of 301313432311121 in words is "three hundred one trillion, three hundred thirteen billion, four hundred thirty-two million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •