Base | Representation |
---|---|
bin | 1110001101010110001… |
… | …1110101100101111101 |
3 | 212100001211022012111002 |
4 | 3203111203311211331 |
5 | 12444404341011031 |
6 | 304045525540045 |
7 | 23431024126100 |
oct | 3432543654575 |
9 | 770054265432 |
10 | 244101110141 |
11 | 94582792a69 |
12 | 3b384b74625 |
13 | 1a031c35015 |
14 | bb59202737 |
15 | 653a004ccb |
hex | 38d58f597d |
244101110141 has 12 divisors (see below), whose sum is σ = 284297754528. Its totient is φ = 208976490072.
The previous prime is 244101110107. The next prime is 244101110147. The reversal of 244101110141 is 141011101442.
It is not a de Polignac number, because 244101110141 - 210 = 244101109117 is a prime.
It is a super-2 number, since 2×2441011101412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244101110147) 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 in 11 ways as a sum of consecutive naturals, for example, 2971361 + ... + 3052406.
It is an arithmetic number, because the mean of its divisors is an integer number (23691479544).
Almost surely, 2244101110141 is an apocalyptic number.
It is an amenable number.
244101110141 is a deficient number, since it is larger than the sum of its proper divisors (40196644387).
244101110141 is an equidigital number, since it uses as much as digits as its factorization.
244101110141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6024608 (or 6024601 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 244101110141 its reverse (141011101442), we get a palindrome (385112211583).
The spelling of 244101110141 in words is "two hundred forty-four billion, one hundred one million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •