Base | Representation |
---|---|
bin | 100010001110111100011010… |
… | …0000110011001000010101101 |
3 | 1110111011220000101221200110011 |
4 | 1010131320310012121002231 |
5 | 303432031332442310404 |
6 | 2544233031513413221 |
7 | 120266163602533063 |
oct | 10435706406310255 |
9 | 1414156011850404 |
10 | 301121031213229 |
11 | 87a45791a02277 |
12 | 2993333410a211 |
13 | cc0378c403156 |
14 | 545049b13a033 |
15 | 24c2cb0875604 |
hex | 111de341990ad |
301121031213229 has 2 divisors, whose sum is σ = 301121031213230. Its totient is φ = 301121031213228.
The previous prime is 301121031213193. The next prime is 301121031213251. The reversal of 301121031213229 is 922312130121103.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 205107940128100 + 96013091085129 = 14321590^2 + 9798627^2 .
It is a cyclic number.
It is not a de Polignac number, because 301121031213229 - 221 = 301121029116077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 301121031213229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (301121031213329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150560515606614 + 150560515606615.
It is an arithmetic number, because the mean of its divisors is an integer number (150560515606615).
Almost surely, 2301121031213229 is an apocalyptic number.
It is an amenable number.
301121031213229 is a deficient number, since it is larger than the sum of its proper divisors (1).
301121031213229 is an equidigital number, since it uses as much as digits as its factorization.
301121031213229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 301121031213229 in words is "three hundred one trillion, one hundred twenty-one billion, thirty-one million, two hundred thirteen thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •