Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0100000111000011100 |
3 | 101111221221000011000100 |
4 | 1212131032200320130 |
5 | 3300301033310022 |
6 | 122312215101100 |
7 | 10643125441032 |
oct | 1463516407034 |
9 | 344857004010 |
10 | 110012010012 |
11 | 42723a03443 |
12 | 193a2971790 |
13 | a4b2b43618 |
14 | 5478a2c552 |
15 | 2cdd1bb1ac |
hex | 199d3a0e1c |
110012010012 has 18 divisors (see below), whose sum is σ = 278085914288. Its totient is φ = 36670669992.
The previous prime is 110012010011. The next prime is 110012010083. The reversal of 110012010012 is 210010210011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110012009976 and 110012010003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012010011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1527944548 + ... + 1527944619.
Almost surely, 2110012010012 is an apocalyptic number.
110012010012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110012010012 is an abundant number, since it is smaller than the sum of its proper divisors (168073904276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110012010012 is a wasteful number, since it uses less digits than its factorization.
110012010012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3055889177 (or 3055889172 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110012010012 its reverse (210010210011), we get a palindrome (320022220023).
The spelling of 110012010012 in words is "one hundred ten billion, twelve million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •