Base | Representation |
---|---|
bin | 11001000001001010100011… |
… | …010111110101011000011110 |
3 | 112102120212210102112201112110 |
4 | 121001022203113311120132 |
5 | 103410222411024414402 |
6 | 1030003350321214450 |
7 | 32114331014631465 |
oct | 3101124327653036 |
9 | 472525712481473 |
10 | 110031213123102 |
11 | 32071a803335a7 |
12 | 10410952791426 |
13 | 4951b8baa3c7b |
14 | 1d257795339dc |
15 | cac26eaba56c |
hex | 6412a35f561e |
110031213123102 has 32 divisors (see below), whose sum is σ = 220114706494464. Its totient is φ = 36668358619200.
The previous prime is 110031213123077. The next prime is 110031213123109. The reversal of 110031213123102 is 201321312130011.
It is a super-2 number, since 2×1100312131231022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110031213123109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 503049202 + ... + 503267882.
It is an arithmetic number, because the mean of its divisors is an integer number (6878584577952).
Almost surely, 2110031213123102 is an apocalyptic number.
110031213123102 is an abundant number, since it is smaller than the sum of its proper divisors (110083493371362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110031213123102 is a wasteful number, since it uses less digits than its factorization.
110031213123102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238224.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 110031213123102 its reverse (201321312130011), we get a palindrome (311352525253113).
The spelling of 110031213123102 in words is "one hundred ten trillion, thirty-one billion, two hundred thirteen million, one hundred twenty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •