Base | Representation |
---|---|
bin | 110011110010101011… |
… | …0010011110100101110 |
3 | 101122002020211200101100 |
4 | 1213211112103310232 |
5 | 3310240313410410 |
6 | 123032241423530 |
7 | 11015120341146 |
oct | 1474526236456 |
9 | 348066750340 |
10 | 111222013230 |
11 | 43194a217a9 |
12 | 1968003aba6 |
13 | a64672ac63 |
14 | 5551603926 |
15 | 2d5e5308c0 |
hex | 19e5593d2e |
111222013230 has 96 divisors (see below), whose sum is σ = 311821604640. Its totient is φ = 27412853760.
The previous prime is 111222013207. The next prime is 111222013237. The reversal of 111222013230 is 32310222111.
It is a super-3 number, since 3×1112220132303 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111222013237) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 723087 + ... + 863306.
It is an arithmetic number, because the mean of its divisors is an integer number (3248141715).
Almost surely, 2111222013230 is an apocalyptic number.
111222013230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111222013230 is an abundant number, since it is smaller than the sum of its proper divisors (200599591410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111222013230 is a wasteful number, since it uses less digits than its factorization.
111222013230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586466 (or 1586463 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 111222013230 its reverse (32310222111), we get a palindrome (143532235341).
The spelling of 111222013230 in words is "one hundred eleven billion, two hundred twenty-two million, thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •