Base | Representation |
---|---|
bin | 1000110110010100100… |
… | …01001110011111001101 |
3 | 1002001210011012111002022 |
4 | 10123022101032133031 |
5 | 14440134023133031 |
6 | 351401414335525 |
7 | 30652265523044 |
oct | 4331221163715 |
9 | 1061704174068 |
10 | 304041224141 |
11 | 107a41387866 |
12 | 4ab1295a5a5 |
13 | 228951550b5 |
14 | 10a03b4755b |
15 | 7d9737897b |
hex | 46ca44e7cd |
304041224141 has 2 divisors, whose sum is σ = 304041224142. Its totient is φ = 304041224140.
The previous prime is 304041224101. The next prime is 304041224209. The reversal of 304041224141 is 141422140403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 268768628041 + 35272596100 = 518429^2 + 187810^2 .
It is an emirp because it is prime and its reverse (141422140403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 304041224141 - 26 = 304041224077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 304041224141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (304041224101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152020612070 + 152020612071.
It is an arithmetic number, because the mean of its divisors is an integer number (152020612071).
Almost surely, 2304041224141 is an apocalyptic number.
It is an amenable number.
304041224141 is a deficient number, since it is larger than the sum of its proper divisors (1).
304041224141 is an equidigital number, since it uses as much as digits as its factorization.
304041224141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 304041224141 its reverse (141422140403), we get a palindrome (445463364544).
The spelling of 304041224141 in words is "three hundred four billion, forty-one million, two hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •