Base | Representation |
---|---|
bin | 110011010100110111… |
… | …1111111010100001100 |
3 | 101112111120100102202220 |
4 | 1212221233333110030 |
5 | 3301213330041022 |
6 | 122345122215340 |
7 | 10651256331225 |
oct | 1465157772414 |
9 | 345446312686 |
10 | 110222112012 |
11 | 42821566161 |
12 | 194411b4550 |
13 | a517526a2c |
14 | 54988c024c |
15 | 2d0186d85c |
hex | 19a9bff50c |
110222112012 has 12 divisors (see below), whose sum is σ = 257184928056. Its totient is φ = 36740704000.
The previous prime is 110222111981. The next prime is 110222112017. The reversal of 110222112012 is 210211222011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 110222111982 and 110222112000.
It is not an unprimeable number, because it can be changed into a prime (110222112017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4592587989 + ... + 4592588012.
It is an arithmetic number, because the mean of its divisors is an integer number (21432077338).
Almost surely, 2110222112012 is an apocalyptic number.
110222112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110222112012 is an abundant number, since it is smaller than the sum of its proper divisors (146962816044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110222112012 is a wasteful number, since it uses less digits than its factorization.
110222112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9185176008 (or 9185176006 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110222112012 its reverse (210211222011), we get a palindrome (320433334023).
The spelling of 110222112012 in words is "one hundred ten billion, two hundred twenty-two million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •