Base | Representation |
---|---|
bin | 11101001000001… |
… | …10001001110011 |
3 | 122000202221010222 |
4 | 32210012021303 |
5 | 1000022442121 |
6 | 40125043255 |
7 | 6024612314 |
oct | 1644061163 |
9 | 560687128 |
10 | 244343411 |
11 | 115a1a904 |
12 | 699b652b |
13 | 3b811b00 |
14 | 2464660b |
15 | 166b80ab |
hex | e906273 |
244343411 has 12 divisors (see below), whose sum is σ = 265035240. Its totient is φ = 225164160.
The previous prime is 244343399. The next prime is 244343419. The reversal of 244343411 is 114343442.
It is not a de Polignac number, because 244343411 - 26 = 244343347 is a prime.
It is a super-2 number, since 2×2443434112 = 119407404998229842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (244343419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 163355 + ... + 164843.
It is an arithmetic number, because the mean of its divisors is an integer number (22086270).
Almost surely, 2244343411 is an apocalyptic number.
244343411 is a deficient number, since it is larger than the sum of its proper divisors (20691829).
244343411 is a wasteful number, since it uses less digits than its factorization.
244343411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2486 (or 2473 counting only the distinct ones).
The product of its digits is 4608, while the sum is 26.
The square root of 244343411 is about 15631.4878050683. The cubic root of 244343411 is about 625.1729961646.
Adding to 244343411 its reverse (114343442), we get a palindrome (358686853).
It can be divided in two parts, 2443 and 43411, that added together give a palindrome (45854).
The spelling of 244343411 in words is "two hundred forty-four million, three hundred forty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •