Base | Representation |
---|---|
bin | 1000110100100110111… |
… | …11000011011101111101 |
3 | 1001222102002201020201202 |
4 | 10122103133003131331 |
5 | 14431243224232031 |
6 | 351130302345245 |
7 | 30620435233055 |
oct | 4322337033575 |
9 | 1058362636652 |
10 | 303122102141 |
11 | 10760a584901 |
12 | 4a8b6b8b225 |
13 | 227798c4b21 |
14 | 10957a50565 |
15 | 7d418212cb |
hex | 46937c377d |
303122102141 has 2 divisors, whose sum is σ = 303122102142. Its totient is φ = 303122102140.
The previous prime is 303122102117. The next prime is 303122102189. The reversal of 303122102141 is 141201221303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 302775062500 + 347039641 = 550250^2 + 18629^2 .
It is an emirp because it is prime and its reverse (141201221303) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-303122102141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (303122102441) 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, 151561051070 + 151561051071.
It is an arithmetic number, because the mean of its divisors is an integer number (151561051071).
Almost surely, 2303122102141 is an apocalyptic number.
It is an amenable number.
303122102141 is a deficient number, since it is larger than the sum of its proper divisors (1).
303122102141 is an equidigital number, since it uses as much as digits as its factorization.
303122102141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 303122102141 its reverse (141201221303), we get a palindrome (444323323444).
The spelling of 303122102141 in words is "three hundred three billion, one hundred twenty-two million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •