Base | Representation |
---|---|
bin | 110011111000000011… |
… | …0000101111000111110 |
3 | 101122112211002202202001 |
4 | 1213300012011320332 |
5 | 3311122442424410 |
6 | 123102202052514 |
7 | 11022440010250 |
oct | 1476006057076 |
9 | 348484082661 |
10 | 111402311230 |
11 | 43277778311 |
12 | 197104aa13a |
13 | a674ba7672 |
14 | 556b537cd0 |
15 | 2d7029733a |
hex | 19f0185e3e |
111402311230 has 16 divisors (see below), whose sum is σ = 229170468960. Its totient is φ = 38195078112.
The previous prime is 111402311143. The next prime is 111402311239. The reversal of 111402311230 is 32113204111.
It is a super-2 number, since 2×1114023112302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111402311198 and 111402311207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111402311239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 795730725 + ... + 795730864.
It is an arithmetic number, because the mean of its divisors is an integer number (14323154310).
Almost surely, 2111402311230 is an apocalyptic number.
111402311230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111402311230 is an abundant number, since it is smaller than the sum of its proper divisors (117768157730).
111402311230 is a wasteful number, since it uses less digits than its factorization.
111402311230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591461603.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111402311230 its reverse (32113204111), we get a palindrome (143515515341).
The spelling of 111402311230 in words is "one hundred eleven billion, four hundred two million, three hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •