Base | Representation |
---|---|
bin | 110100010110001011… |
… | …0110010110000000001 |
3 | 101202011021111110010022 |
4 | 1220230112302300001 |
5 | 3320210302302431 |
6 | 123350355343225 |
7 | 11056464321233 |
oct | 1505426626001 |
9 | 352137443108 |
10 | 112413322241 |
11 | 43746431900 |
12 | 19952bb1b15 |
13 | a7a649b62c |
14 | 5625910253 |
15 | 2dcde0107b |
hex | 1a2c5b2c01 |
112413322241 has 12 divisors (see below), whose sum is σ = 123578816256. Its totient is φ = 102179815320.
The previous prime is 112413322237. The next prime is 112413322261. The reversal of 112413322241 is 142223314211.
It is a happy number.
It is not a de Polignac number, because 112413322241 - 22 = 112413322237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112413322241.
It is not an unprimeable number, because it can be changed into a prime (112413322261) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 871760 + ... + 992366.
It is an arithmetic number, because the mean of its divisors is an integer number (10298234688).
Almost surely, 2112413322241 is an apocalyptic number.
112413322241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112413322241 is a deficient number, since it is larger than the sum of its proper divisors (11165494015).
112413322241 is a wasteful number, since it uses less digits than its factorization.
112413322241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128332 (or 128321 counting only the distinct ones).
The product of its digits is 2304, while the sum is 26.
Adding to 112413322241 its reverse (142223314211), we get a palindrome (254636636452).
The spelling of 112413322241 in words is "one hundred twelve billion, four hundred thirteen million, three hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •