Base | Representation |
---|---|
bin | 11101000110110… |
… | …01011000010111 |
3 | 122000102121120211 |
4 | 32203121120113 |
5 | 1000001110043 |
6 | 40121110251 |
7 | 6023216542 |
oct | 1643313027 |
9 | 560377524 |
10 | 244160023 |
11 | 115905048 |
12 | 69928387 |
13 | 3b7794b3 |
14 | 245d9859 |
15 | 1667da9d |
hex | e8d9617 |
244160023 has 4 divisors (see below), whose sum is σ = 245110320. Its totient is φ = 243209728.
The previous prime is 244160017. The next prime is 244160039. The reversal of 244160023 is 320061442.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320061442 = 2 ⋅160030721.
It is a cyclic number.
It is not a de Polignac number, because 244160023 - 221 = 242062871 is a prime.
It is a super-2 number, since 2×2441600232 = 119228233662721058, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 244159976 and 244160003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244160053) 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, 474763 + ... + 475276.
It is an arithmetic number, because the mean of its divisors is an integer number (61277580).
Almost surely, 2244160023 is an apocalyptic number.
244160023 is a deficient number, since it is larger than the sum of its proper divisors (950297).
244160023 is an equidigital number, since it uses as much as digits as its factorization.
244160023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950296.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 244160023 is about 15625.6207236705. The cubic root of 244160023 is about 625.0165525216.
The spelling of 244160023 in words is "two hundred forty-four million, one hundred sixty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •