Base | Representation |
---|---|
bin | 110100010101111011… |
… | …1100000100011000111 |
3 | 101202010201001210102220 |
4 | 1220223313200203013 |
5 | 3320201202334343 |
6 | 123345503503423 |
7 | 11056334523453 |
oct | 1505367404307 |
9 | 352121053386 |
10 | 112405121223 |
11 | 437418402aa |
12 | 199502b7b73 |
13 | a7a4889865 |
14 | 56247b7663 |
15 | 2dcd331183 |
hex | 1a2bde08c7 |
112405121223 has 16 divisors (see below), whose sum is σ = 150959657472. Its totient is φ = 74395440000.
The previous prime is 112405121221. The next prime is 112405121233. The reversal of 112405121223 is 322121504211.
It is a happy number.
It is not a de Polignac number, because 112405121223 - 21 = 112405121221 is a prime.
It is a super-2 number, since 2×1124051212232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112405121193 and 112405121202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112405121221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32418 + ... + 475248.
It is an arithmetic number, because the mean of its divisors is an integer number (9434978592).
Almost surely, 2112405121223 is an apocalyptic number.
112405121223 is a deficient number, since it is larger than the sum of its proper divisors (38554536249).
112405121223 is a wasteful number, since it uses less digits than its factorization.
112405121223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443446.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 112405121223 its reverse (322121504211), we get a palindrome (434526625434).
The spelling of 112405121223 in words is "one hundred twelve billion, four hundred five million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •