Base | Representation |
---|---|
bin | 1000110010111101110… |
… | …11101011000111011001 |
3 | 1001220010122122202101211 |
4 | 10121132323223013121 |
5 | 14422442021141441 |
6 | 350503004543121 |
7 | 30556541054164 |
oct | 4313673530731 |
9 | 1056118582354 |
10 | 302240412121 |
11 | 1071a791906a |
12 | 4a6ab851aa1 |
13 | 2266903c55b |
14 | 108b28dcadb |
15 | 7cde20ea81 |
hex | 465eeeb1d9 |
302240412121 has 2 divisors, whose sum is σ = 302240412122. Its totient is φ = 302240412120.
The previous prime is 302240412101. The next prime is 302240412137. The reversal of 302240412121 is 121214042203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 300940016400 + 1300395721 = 548580^2 + 36061^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-302240412121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 302240412092 and 302240412101.
It is not a weakly prime, because it can be changed into another prime (302240412101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151120206060 + 151120206061.
It is an arithmetic number, because the mean of its divisors is an integer number (151120206061).
Almost surely, 2302240412121 is an apocalyptic number.
It is an amenable number.
302240412121 is a deficient number, since it is larger than the sum of its proper divisors (1).
302240412121 is an equidigital number, since it uses as much as digits as its factorization.
302240412121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 302240412121 its reverse (121214042203), we get a palindrome (423454454324).
The spelling of 302240412121 in words is "three hundred two billion, two hundred forty million, four hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •