Base | Representation |
---|---|
bin | 11110111010010000110… |
… | …110011100000011101111 |
3 | 21112001210020202012110102 |
4 | 132322100312130003233 |
5 | 234300221333042111 |
6 | 4303452430301315 |
7 | 306315161245235 |
oct | 36722066340357 |
9 | 7461706665412 |
10 | 2124144034031 |
11 | 749931a27018 |
12 | 2a380b65783b |
13 | 1253c9160686 |
14 | 74b48320955 |
15 | 3a3c1baa13b |
hex | 1ee90d9c0ef |
2124144034031 has 2 divisors, whose sum is σ = 2124144034032. Its totient is φ = 2124144034030.
The previous prime is 2124144034027. The next prime is 2124144034039. The reversal of 2124144034031 is 1304304414212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2124144034031 - 22 = 2124144034027 is a prime.
It is a super-2 number, since 2×21241440340312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2124144033985 and 2124144034003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2124144034039) 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, 1062072017015 + 1062072017016.
It is an arithmetic number, because the mean of its divisors is an integer number (1062072017016).
Almost surely, 22124144034031 is an apocalyptic number.
2124144034031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2124144034031 is an equidigital number, since it uses as much as digits as its factorization.
2124144034031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 2124144034031 its reverse (1304304414212), we get a palindrome (3428448448243).
The spelling of 2124144034031 in words is "two trillion, one hundred twenty-four billion, one hundred forty-four million, thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •