Base | Representation |
---|---|
bin | 11101001010010… |
… | …11001111011101 |
3 | 122001022022022221 |
4 | 32211023033131 |
5 | 1000111021042 |
6 | 40135105341 |
7 | 6030201331 |
oct | 1645131735 |
9 | 561268287 |
10 | 244626397 |
11 | 1160a3484 |
12 | 69b12251 |
13 | 3b8b0862 |
14 | 246bb7c1 |
15 | 16721d67 |
hex | e94b3dd |
244626397 has 8 divisors (see below), whose sum is σ = 253236600. Its totient is φ = 236027904.
The previous prime is 244626373. The next prime is 244626407. The reversal of 244626397 is 793626442.
It can be written as a sum of positive squares in 4 ways, for example, as 52693081 + 191933316 = 7259^2 + 13854^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 8-Lehmer number, since φ(244626397) divides (244626397-1)8.
It is a cyclic number.
It is not a de Polignac number, because 244626397 - 223 = 236237789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244426397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76413 + ... + 79549.
It is an arithmetic number, because the mean of its divisors is an integer number (31654575).
Almost surely, 2244626397 is an apocalyptic number.
It is an amenable number.
244626397 is a deficient number, since it is larger than the sum of its proper divisors (8610203).
244626397 is a wasteful number, since it uses less digits than its factorization.
244626397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5855.
The product of its digits is 435456, while the sum is 43.
The square root of 244626397 is about 15640.5369792728. The cubic root of 244626397 is about 625.4142508134.
The spelling of 244626397 in words is "two hundred forty-four million, six hundred twenty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •