Base | Representation |
---|---|
bin | 11001000001001010100011… |
… | …111001101111000011111110 |
3 | 112102120212211001021020012220 |
4 | 121001022203321233003332 |
5 | 103410222420313310420 |
6 | 1030003351235510210 |
7 | 32114331153314232 |
oct | 3101124371570376 |
9 | 472525731236186 |
10 | 110031222010110 |
11 | 32071a85353535 |
12 | 10410955758366 |
13 | 4951b9089605b |
14 | 1d2577a7a85c2 |
15 | cac270773840 |
hex | 6412a3e6f0fe |
110031222010110 has 64 divisors (see below), whose sum is σ = 271513998895104. Its totient is φ = 28520377862400.
The previous prime is 110031222010097. The next prime is 110031222010133. The reversal of 110031222010110 is 11010222130011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 110031222010110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 164715154 + ... + 165381813.
It is an arithmetic number, because the mean of its divisors is an integer number (4242406232736).
Almost surely, 2110031222010110 is an apocalyptic number.
110031222010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110031222010110 is an abundant number, since it is smaller than the sum of its proper divisors (161482776884994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110031222010110 is a wasteful number, since it uses less digits than its factorization.
110031222010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330097289.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 110031222010110 its reverse (11010222130011), we get a palindrome (121041444140121).
The spelling of 110031222010110 in words is "one hundred ten trillion, thirty-one billion, two hundred twenty-two million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •