Base | Representation |
---|---|
bin | 10110100011111010… |
… | …10011101011011010 |
3 | 1011021010200220200120 |
4 | 23101331103223122 |
5 | 144301241202442 |
6 | 5321523414110 |
7 | 606105035112 |
oct | 132175235332 |
9 | 34233626616 |
10 | 12112444122 |
11 | 51561825a9 |
12 | 2420524336 |
13 | 11b05444cc |
14 | 82c92c042 |
15 | 4ad5824ec |
hex | 2d1f53ada |
12112444122 has 8 divisors (see below), whose sum is σ = 24224888256. Its totient is φ = 4037481372.
The previous prime is 12112444111. The next prime is 12112444133. The reversal of 12112444122 is 22144421121.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12112444111) and next prime (12112444133).
It is a sphenic number, since it is the product of 3 distinct primes.
12112444122 is an admirable number.
It is a super-2 number, since 2×121124441222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12112444092 and 12112444101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1009370338 + ... + 1009370349.
It is an arithmetic number, because the mean of its divisors is an integer number (3028111032).
Almost surely, 212112444122 is an apocalyptic number.
12112444122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12112444122 is a wasteful number, since it uses less digits than its factorization.
12112444122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2018740692.
The product of its digits is 1024, while the sum is 24.
Adding to 12112444122 its reverse (22144421121), we get a palindrome (34256865243).
The spelling of 12112444122 in words is "twelve billion, one hundred twelve million, four hundred forty-four thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •