Base | Representation |
---|---|
bin | 11101000110101… |
… | …01111001000011 |
3 | 122000101212222111 |
4 | 32203111321003 |
5 | 1000000130411 |
6 | 40120520151 |
7 | 6023130064 |
oct | 1643257103 |
9 | 560355874 |
10 | 244145731 |
11 | 1158a5335 |
12 | 69920057 |
13 | 3b772b3b |
14 | 245d456b |
15 | 16679721 |
hex | e8d5e43 |
244145731 has 4 divisors (see below), whose sum is σ = 245557152. Its totient is φ = 242734312.
The previous prime is 244145663. The next prime is 244145747. The reversal of 244145731 is 137541442.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 244145731 - 213 = 244137539 is a prime.
It is a super-2 number, since 2×2441457312 = 119214275931048722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 244145693 and 244145702.
It is not an unprimeable number, because it can be changed into a prime (244145761) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 705451 + ... + 705796.
It is an arithmetic number, because the mean of its divisors is an integer number (61389288).
Almost surely, 2244145731 is an apocalyptic number.
244145731 is a deficient number, since it is larger than the sum of its proper divisors (1411421).
244145731 is a wasteful number, since it uses less digits than its factorization.
244145731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411420.
The product of its digits is 13440, while the sum is 31.
The square root of 244145731 is about 15625.1633911457. The cubic root of 244145731 is about 625.0043570896.
The spelling of 244145731 in words is "two hundred forty-four million, one hundred forty-five thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •