Base | Representation |
---|---|
bin | 110011101100111101… |
… | …0010000100000010110 |
3 | 101121120212201222221211 |
4 | 1213121322100200112 |
5 | 3304342202011410 |
6 | 123001224332034 |
7 | 11010300236164 |
oct | 1473172204026 |
9 | 347525658854 |
10 | 111030110230 |
11 | 430a666a186 |
12 | 1962791401a |
13 | a615a4a2a0 |
14 | 5533d2c234 |
15 | 2d4c77568a |
hex | 19d9e90816 |
111030110230 has 32 divisors (see below), whose sum is σ = 221044569984. Its totient is φ = 39887738496.
The previous prime is 111030110227. The next prime is 111030110251. The reversal of 111030110230 is 32011030111.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a self number, because there is not a number n which added to its sum of digits gives 111030110230.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11536782 + ... + 11546401.
It is an arithmetic number, because the mean of its divisors is an integer number (6907642812).
Almost surely, 2111030110230 is an apocalyptic number.
111030110230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111030110230 is a deficient number, since it is larger than the sum of its proper divisors (110014459754).
111030110230 is a wasteful number, since it uses less digits than its factorization.
111030110230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23083240.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 111030110230 its reverse (32011030111), we get a palindrome (143041140341).
The spelling of 111030110230 in words is "one hundred eleven billion, thirty million, one hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •