Base | Representation |
---|---|
bin | 100010111111001101010… |
… | …111001010110000110101 |
3 | 22111212000001001202222001 |
4 | 202333031113022300311 |
5 | 303343033010334031 |
6 | 5040311313335301 |
7 | 335464406553616 |
oct | 42771527126065 |
9 | 8455001052861 |
10 | 2404332121141 |
11 | 84774288a995 |
12 | 329b85b67531 |
13 | 14595c55a4b2 |
14 | 8452813bc0d |
15 | 4281eda2861 |
hex | 22fcd5cac35 |
2404332121141 has 2 divisors, whose sum is σ = 2404332121142. Its totient is φ = 2404332121140.
The previous prime is 2404332121109. The next prime is 2404332121153. The reversal of 2404332121141 is 1411212334042.
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., 1962439558641 + 441892562500 = 1400871^2 + 664750^2 .
It is a cyclic number.
It is not a de Polignac number, because 2404332121141 - 25 = 2404332121109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2404332121441) 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, 1202166060570 + 1202166060571.
It is an arithmetic number, because the mean of its divisors is an integer number (1202166060571).
Almost surely, 22404332121141 is an apocalyptic number.
It is an amenable number.
2404332121141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2404332121141 is an equidigital number, since it uses as much as digits as its factorization.
2404332121141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 2404332121141 its reverse (1411212334042), we get a palindrome (3815544455183).
The spelling of 2404332121141 in words is "two trillion, four hundred four billion, three hundred thirty-two million, one hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •