Base | Representation |
---|---|
bin | 110011101111011001… |
… | …1011101001000101000 |
3 | 101121210121020020211100 |
4 | 1213132303131020220 |
5 | 3310024211304112 |
6 | 123013320201400 |
7 | 11012315141022 |
oct | 1473663351050 |
9 | 347717206740 |
10 | 111112213032 |
11 | 43138a47237 |
12 | 1964b309260 |
13 | a629a65822 |
14 | 5540bc1012 |
15 | 2d54a922dc |
hex | 19decdd228 |
111112213032 has 96 divisors (see below), whose sum is σ = 319335307200. Its totient is φ = 34826592768.
The previous prime is 111112212989. The next prime is 111112213039. The reversal of 111112213032 is 230312211111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 111112212996 and 111112213014.
It is not an unprimeable number, because it can be changed into a prime (111112213039) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 470913 + ... + 666320.
It is an arithmetic number, because the mean of its divisors is an integer number (3326409450).
Almost surely, 2111112213032 is an apocalyptic number.
111112213032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111112213032 is an abundant number, since it is smaller than the sum of its proper divisors (208223094168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111112213032 is a wasteful number, since it uses less digits than its factorization.
111112213032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1137327 (or 1137320 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 111112213032 its reverse (230312211111), we get a palindrome (341424424143).
The spelling of 111112213032 in words is "one hundred eleven billion, one hundred twelve million, two hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •