Base | Representation |
---|---|
bin | 1110001100111111000… |
… | …1011111010001010111 |
3 | 212022211001121210022002 |
4 | 3203033301133101113 |
5 | 12444210012303211 |
6 | 304032141025515 |
7 | 23425434665225 |
oct | 3431761372127 |
9 | 768731553262 |
10 | 244004025431 |
11 | 94532a02871 |
12 | 3b35855529b |
13 | 1a017aa244a |
14 | bb4a36db15 |
15 | 653172903b |
hex | 38cfc5f457 |
244004025431 has 2 divisors, whose sum is σ = 244004025432. Its totient is φ = 244004025430.
The previous prime is 244004025379. The next prime is 244004025457. The reversal of 244004025431 is 134520400442.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 244004025431 - 214 = 244004009047 is a prime.
It is a super-2 number, since 2×2440040254312 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 244004025394 and 244004025403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244004085431) 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, 122002012715 + 122002012716.
It is an arithmetic number, because the mean of its divisors is an integer number (122002012716).
Almost surely, 2244004025431 is an apocalyptic number.
244004025431 is a deficient number, since it is larger than the sum of its proper divisors (1).
244004025431 is an equidigital number, since it uses as much as digits as its factorization.
244004025431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 29.
Adding to 244004025431 its reverse (134520400442), we get a palindrome (378524425873).
The spelling of 244004025431 in words is "two hundred forty-four billion, four million, twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •