Base | Representation |
---|---|
bin | 11001000010010101110010… |
… | …101001011011100100110110 |
3 | 112102212121022121100212021111 |
4 | 121002111302221123210312 |
5 | 103413033334001443110 |
6 | 1030104430545105234 |
7 | 32123221003211344 |
oct | 3102256251334466 |
9 | 472777277325244 |
10 | 110112000031030 |
11 | 320a3267449208 |
12 | 1042453a02821a |
13 | 4959694c5687a |
14 | 1d296409ca994 |
15 | cae3ec1c6e8a |
hex | 642572a5b936 |
110112000031030 has 8 divisors (see below), whose sum is σ = 198201600055872. Its totient is φ = 44044800012408.
The previous prime is 110112000030941. The next prime is 110112000031057. The reversal of 110112000031030 is 30130000211011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 110112000031030.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5505600001542 + ... + 5505600001561.
It is an arithmetic number, because the mean of its divisors is an integer number (24775200006984).
Almost surely, 2110112000031030 is an apocalyptic number.
110112000031030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110112000031030 is a deficient number, since it is larger than the sum of its proper divisors (88089600024842).
110112000031030 is a wasteful number, since it uses less digits than its factorization.
110112000031030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11011200003110.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 110112000031030 its reverse (30130000211011), we get a palindrome (140242000242041).
The spelling of 110112000031030 in words is "one hundred ten trillion, one hundred twelve billion, thirty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •