Base | Representation |
---|---|
bin | 11111001100110010001… |
… | …010100110010110011111 |
3 | 21120222010011022012102112 |
4 | 133030302022212112133 |
5 | 240111433230220111 |
6 | 4320542014344235 |
7 | 310621033011365 |
oct | 37146212462637 |
9 | 7528104265375 |
10 | 2144030320031 |
11 | 757307248026 |
12 | 2a763b4bb07b |
13 | 127248102602 |
14 | 75ab3485635 |
15 | 3ab87962e8b |
hex | 1f3322a659f |
2144030320031 has 2 divisors, whose sum is σ = 2144030320032. Its totient is φ = 2144030320030.
The previous prime is 2144030320009. The next prime is 2144030320051. The reversal of 2144030320031 is 1300230304412.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2144030320031 - 26 = 2144030319967 is a prime.
It is a super-2 number, since 2×21440303200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2144030319979 and 2144030320006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2144030320051) 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, 1072015160015 + 1072015160016.
It is an arithmetic number, because the mean of its divisors is an integer number (1072015160016).
Almost surely, 22144030320031 is an apocalyptic number.
2144030320031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2144030320031 is an equidigital number, since it uses as much as digits as its factorization.
2144030320031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2144030320031 its reverse (1300230304412), we get a palindrome (3444260624443).
The spelling of 2144030320031 in words is "two trillion, one hundred forty-four billion, thirty million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •