Base | Representation |
---|---|
bin | 110011110101000101… |
… | …1010101101000001000 |
3 | 101122021220021102001100 |
4 | 1213222023111220020 |
5 | 3310422033214422 |
6 | 123044254021400 |
7 | 11020123041441 |
oct | 1475213255010 |
9 | 348256242040 |
10 | 111303023112 |
11 | 43226722716 |
12 | 196a31a7860 |
13 | a65a452bb8 |
14 | 555c2902c8 |
15 | 2d666d37ac |
hex | 19ea2d5a08 |
111303023112 has 48 divisors (see below), whose sum is σ = 317311254000. Its totient is φ = 35148322656.
The previous prime is 111303023099. The next prime is 111303023119. The reversal of 111303023112 is 211320303111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (111303023119) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 40679562 + ... + 40682297.
It is an arithmetic number, because the mean of its divisors is an integer number (6610651125).
Almost surely, 2111303023112 is an apocalyptic number.
111303023112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111303023112 is an abundant number, since it is smaller than the sum of its proper divisors (206008230888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111303023112 is a wasteful number, since it uses less digits than its factorization.
111303023112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81361890 (or 81361883 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 111303023112 its reverse (211320303111), we get a palindrome (322623326223).
The spelling of 111303023112 in words is "one hundred eleven billion, three hundred three million, twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •