Base | Representation |
---|---|
bin | 101011101101110011100… |
… | …000100000011111010111 |
3 | 101122012011021212001210012 |
4 | 223231303200200133113 |
5 | 343204414212311211 |
6 | 10220023530150435 |
7 | 430016616013505 |
oct | 53556340403727 |
9 | 11565137761705 |
10 | 3004120041431 |
11 | a5904949a8a3 |
12 | 40627588241b |
13 | 18a397291342 |
14 | a5586177675 |
15 | 532262cbd8b |
hex | 2bb738207d7 |
3004120041431 has 2 divisors, whose sum is σ = 3004120041432. Its totient is φ = 3004120041430.
The previous prime is 3004120041371. The next prime is 3004120041457. The reversal of 3004120041431 is 1341400214003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3004120041431 - 26 = 3004120041367 is a prime.
It is a super-2 number, since 2×30041200414312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3004120041397 and 3004120041406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3004120041491) 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, 1502060020715 + 1502060020716.
It is an arithmetic number, because the mean of its divisors is an integer number (1502060020716).
Almost surely, 23004120041431 is an apocalyptic number.
3004120041431 is a deficient number, since it is larger than the sum of its proper divisors (1).
3004120041431 is an equidigital number, since it uses as much as digits as its factorization.
3004120041431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 3004120041431 its reverse (1341400214003), we get a palindrome (4345520255434).
The spelling of 3004120041431 in words is "three trillion, four billion, one hundred twenty million, forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •