Base | Representation |
---|---|
bin | 101101010000100011000… |
… | …011000010011110001111 |
3 | 102000022211022020112121002 |
4 | 231100203003002132033 |
5 | 401424033421241143 |
6 | 10340440334330515 |
7 | 440462163353516 |
oct | 55204303023617 |
9 | 12008738215532 |
10 | 3110144321423 |
11 | a9a00642a697 |
12 | 422925059a3b |
13 | 197392bbb0a9 |
14 | aa76332767d |
15 | 55d7e3485b8 |
hex | 2d4230c278f |
3110144321423 has 2 divisors, whose sum is σ = 3110144321424. Its totient is φ = 3110144321422.
The previous prime is 3110144321393. The next prime is 3110144321489. The reversal of 3110144321423 is 3241234410113.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3110144321423 - 26 = 3110144321359 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3110144321723) 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, 1555072160711 + 1555072160712.
It is an arithmetic number, because the mean of its divisors is an integer number (1555072160712).
Almost surely, 23110144321423 is an apocalyptic number.
3110144321423 is a deficient number, since it is larger than the sum of its proper divisors (1).
3110144321423 is an equidigital number, since it uses as much as digits as its factorization.
3110144321423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 3110144321423 its reverse (3241234410113), we get a palindrome (6351378731536).
The spelling of 3110144321423 in words is "three trillion, one hundred ten billion, one hundred forty-four million, three hundred twenty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •