Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …000011011101100000110100 |
3 | 112102211112221001202020121100 |
4 | 121002023203003131200310 |
5 | 103412343322224013022 |
6 | 1030055411313450100 |
7 | 32122351305045420 |
oct | 3102134303354064 |
9 | 472745831666540 |
10 | 110101001001012 |
11 | 3209963281315a |
12 | 1042238a570930 |
13 | 49586312ab898 |
14 | 1d28cb9ccdb80 |
15 | cadea677a1ac |
hex | 6422e30dd834 |
110101001001012 has 144 divisors (see below), whose sum is σ = 320585775677440. Its totient is φ = 31208590357056.
The previous prime is 110101001001007. The next prime is 110101001001031. The reversal of 110101001001012 is 210100100101011.
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 = 110101001000985 and 110101001001003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1282901439 + ... + 1282987257.
Almost surely, 2110101001001012 is an apocalyptic number.
110101001001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110101001001012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160292887838720).
110101001001012 is an abundant number, since it is smaller than the sum of its proper divisors (210484774676428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110101001001012 is a wasteful number, since it uses less digits than its factorization.
110101001001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126050 (or 126045 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110101001001012 its reverse (210100100101011), we get a palindrome (320201101102023).
Subtracting 110101001001012 from its reverse (210100100101011), we obtain a palindrome (99999099099999).
The spelling of 110101001001012 in words is "one hundred ten trillion, one hundred one billion, one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •