Base | Representation |
---|---|
bin | 110011110010111010… |
… | …1111111110111101110 |
3 | 101122002211110201021120 |
4 | 1213211311333313232 |
5 | 3310244430220420 |
6 | 123033135441410 |
7 | 11015251056360 |
oct | 1474565776756 |
9 | 348084421246 |
10 | 111230320110 |
11 | 43199685898 |
12 | 19682986266 |
13 | a648378c80 |
14 | 5552766d30 |
15 | 2d60121d40 |
hex | 19e5d7fdee |
111230320110 has 64 divisors (see below), whose sum is σ = 328557261312. Its totient is φ = 23468374656.
The previous prime is 111230320109. The next prime is 111230320129. The reversal of 111230320110 is 11023032111.
It is a happy number.
It is a super-2 number, since 2×1112303201102 (a number of 23 digits) contains 22 as substring.
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 111230320110.
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, 20369124 + ... + 20374583.
It is an arithmetic number, because the mean of its divisors is an integer number (5133707208).
Almost surely, 2111230320110 is an apocalyptic number.
111230320110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111230320110 is an abundant number, since it is smaller than the sum of its proper divisors (217326941202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111230320110 is a wasteful number, since it uses less digits than its factorization.
111230320110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40743737.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 111230320110 its reverse (11023032111), we get a palindrome (122253352221).
The spelling of 111230320110 in words is "one hundred eleven billion, two hundred thirty million, three hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •