Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …010010011011101100111100 |
3 | 112102211122210111201010020200 |
4 | 121002030211102123230330 |
5 | 103412403111212101022 |
6 | 1030100113451043500 |
7 | 32122420660214661 |
oct | 3102144522335474 |
9 | 472748714633220 |
10 | 110102112222012 |
11 | 3209a052aa1a19 |
12 | 1042263a740590 |
13 | 495877a58aac1 |
14 | 1d28d8370da68 |
15 | cae01e0cabac |
hex | 64232549bb3c |
110102112222012 has 18 divisors (see below), whose sum is σ = 278313672561288. Its totient is φ = 36700704073992.
The previous prime is 110102112221957. The next prime is 110102112222043. The reversal of 110102112222012 is 210222211201011.
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 (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1529196003048 + ... + 1529196003119.
Almost surely, 2110102112222012 is an apocalyptic number.
110102112222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110102112222012 is an abundant number, since it is smaller than the sum of its proper divisors (168211560339276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102112222012 is a wasteful number, since it uses less digits than its factorization.
110102112222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3058392006177 (or 3058392006172 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 110102112222012 its reverse (210222211201011), we get a palindrome (320324323423023).
The spelling of 110102112222012 in words is "one hundred ten trillion, one hundred two billion, one hundred twelve million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •