Base | Representation |
---|---|
bin | 110011111000100101… |
… | …0000100001100110101 |
3 | 101122121001122001122020 |
4 | 1213301022010030311 |
5 | 3311142023130401 |
6 | 123104040023353 |
7 | 11023044323310 |
oct | 1476112041465 |
9 | 348531561566 |
10 | 111420130101 |
11 | 43286838955 |
12 | 19716461b59 |
13 | a6787a6087 |
14 | 556da55977 |
15 | 2d71b16d36 |
hex | 19f1284335 |
111420130101 has 8 divisors (see below), whose sum is σ = 169783055424. Its totient is φ = 63668645760.
The previous prime is 111420130099. The next prime is 111420130103. The reversal of 111420130101 is 101031024111.
It is an interprime number because it is at equal distance from previous prime (111420130099) and next prime (111420130103).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111420130101 - 21 = 111420130099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111420130103) 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 7 ways as a sum of consecutive naturals, for example, 2652860220 + ... + 2652860261.
It is an arithmetic number, because the mean of its divisors is an integer number (21222881928).
Almost surely, 2111420130101 is an apocalyptic number.
It is an amenable number.
111420130101 is a deficient number, since it is larger than the sum of its proper divisors (58362925323).
111420130101 is an equidigital number, since it uses as much as digits as its factorization.
111420130101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5305720491.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 111420130101 its reverse (101031024111), we get a palindrome (212451154212).
The spelling of 111420130101 in words is "one hundred eleven billion, four hundred twenty million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •