Base | Representation |
---|---|
bin | 1000110100101010010… |
… | …01110111101001010001 |
3 | 1001222111001101211212002 |
4 | 10122111021313221101 |
5 | 14431322411244441 |
6 | 351133142443345 |
7 | 30621225234425 |
oct | 4322511675121 |
9 | 1058431354762 |
10 | 303150103121 |
11 | 10762436a408 |
12 | 4a904433555 |
13 | 22782649c58 |
14 | 1095b65cb85 |
15 | 7d44002b9b |
hex | 4695277a51 |
303150103121 has 2 divisors, whose sum is σ = 303150103122. Its totient is φ = 303150103120.
The previous prime is 303150103103. The next prime is 303150103159. The reversal of 303150103121 is 121301051303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 266783613121 + 36366490000 = 516511^2 + 190700^2 .
It is a cyclic number.
It is not a de Polignac number, because 303150103121 - 26 = 303150103057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 303150103093 and 303150103102.
It is not a weakly prime, because it can be changed into another prime (303150103181) by changing a digit.
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 as a sum of consecutive naturals, namely, 151575051560 + 151575051561.
It is an arithmetic number, because the mean of its divisors is an integer number (151575051561).
Almost surely, 2303150103121 is an apocalyptic number.
It is an amenable number.
303150103121 is a deficient number, since it is larger than the sum of its proper divisors (1).
303150103121 is an equidigital number, since it uses as much as digits as its factorization.
303150103121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 303150103121 its reverse (121301051303), we get a palindrome (424451154424).
The spelling of 303150103121 in words is "three hundred three billion, one hundred fifty million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •