Base | Representation |
---|---|
bin | 101101011101011101110… |
… | …000110100000000101111 |
3 | 102001122121221001111222221 |
4 | 231131131300310000233 |
5 | 402140440130114411 |
6 | 10351052524220211 |
7 | 441462662265445 |
oct | 55353560640057 |
9 | 12048557044887 |
10 | 3124014301231 |
11 | aa49836a281a |
12 | 42555609a667 |
13 | 1987935a5235 |
14 | ab2bb436b95 |
15 | 563e1d47071 |
hex | 2d75dc3402f |
3124014301231 has 2 divisors, whose sum is σ = 3124014301232. Its totient is φ = 3124014301230.
The previous prime is 3124014301171. The next prime is 3124014301237. The reversal of 3124014301231 is 1321034104213.
It is a strong prime.
It is an emirp because it is prime and its reverse (1321034104213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3124014301231 - 229 = 3123477430319 is a prime.
It is a super-2 number, since 2×31240143012312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3124014301196 and 3124014301205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3124014301237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1562007150615 + 1562007150616.
It is an arithmetic number, because the mean of its divisors is an integer number (1562007150616).
Almost surely, 23124014301231 is an apocalyptic number.
3124014301231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3124014301231 is an equidigital number, since it uses as much as digits as its factorization.
3124014301231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 3124014301231 its reverse (1321034104213), we get a palindrome (4445048405444).
The spelling of 3124014301231 in words is "three trillion, one hundred twenty-four billion, fourteen million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •