Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1100010011000111100 |
3 | 101112110002122221201210 |
4 | 1212220133202120330 |
5 | 3301142430201022 |
6 | 122343050204420 |
7 | 10650612142314 |
oct | 1465037423074 |
9 | 345402587653 |
10 | 110201022012 |
11 | 42810670a04 |
12 | 19436123710 |
13 | a513051443 |
14 | 5495b90444 |
15 | 2ceeaa4a0c |
hex | 19a87e263c |
110201022012 has 96 divisors (see below), whose sum is σ = 265323663360. Its totient is φ = 35581809600.
The previous prime is 110201021999. The next prime is 110201022017. The reversal of 110201022012 is 210220102011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201022017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27201387 + ... + 27205437.
It is an arithmetic number, because the mean of its divisors is an integer number (2763788160).
Almost surely, 2110201022012 is an apocalyptic number.
110201022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110201022012 is an abundant number, since it is smaller than the sum of its proper divisors (155122641348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201022012 is a wasteful number, since it uses less digits than its factorization.
110201022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4591 (or 4589 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110201022012 its reverse (210220102011), we get a palindrome (320421124023).
The spelling of 110201022012 in words is "one hundred ten billion, two hundred one million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •