Base | Representation |
---|---|
bin | 110111011110101100100101… |
… | …111110111111110000100011 |
3 | 1011222221100212121101002110212 |
4 | 313132230211332333300203 |
5 | 223440212121211333011 |
6 | 2222540552120044335 |
7 | 102252364425015203 |
oct | 6736544576776043 |
9 | 1158840777332425 |
10 | 244002024324131 |
11 | 7082374a67a737 |
12 | 234492883036ab |
13 | a61c3a4b64aa8 |
14 | 4437a9222a403 |
15 | 1d320bc83108b |
hex | ddeb25fbfc23 |
244002024324131 has 2 divisors, whose sum is σ = 244002024324132. Its totient is φ = 244002024324130.
The previous prime is 244002024324011. The next prime is 244002024324167. The reversal of 244002024324131 is 131423420200442.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 244002024324131 - 234 = 243984844454947 is a prime.
It is a super-2 number, since 2×2440020243241312 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (244002024324931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122001012162065 + 122001012162066.
It is an arithmetic number, because the mean of its divisors is an integer number (122001012162066).
Almost surely, 2244002024324131 is an apocalyptic number.
244002024324131 is a deficient number, since it is larger than the sum of its proper divisors (1).
244002024324131 is an equidigital number, since it uses as much as digits as its factorization.
244002024324131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 244002024324131 its reverse (131423420200442), we get a palindrome (375425444524573).
The spelling of 244002024324131 in words is "two hundred forty-four trillion, two billion, twenty-four million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •