Base | Representation |
---|---|
bin | 110011101100111101… |
… | …0010101100101001111 |
3 | 101121120212210001110221 |
4 | 1213121322111211033 |
5 | 3304342203143043 |
6 | 123001225012211 |
7 | 11010300353620 |
oct | 1473172254517 |
9 | 347525701427 |
10 | 111030131023 |
11 | 430a6683869 |
12 | 19627924067 |
13 | a615a568a6 |
14 | 5533d35a47 |
15 | 2d4c77b8ed |
hex | 19d9e9594f |
111030131023 has 8 divisors (see below), whose sum is σ = 132408603648. Its totient is φ = 91030914744.
The previous prime is 111030130963. The next prime is 111030131083. The reversal of 111030131023 is 320131030111.
It is an interprime number because it is at equal distance from previous prime (111030130963) and next prime (111030131083).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-111030131023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111030130988 and 111030131006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111030131083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 344813911 + ... + 344814232.
It is an arithmetic number, because the mean of its divisors is an integer number (16551075456).
Almost surely, 2111030131023 is an apocalyptic number.
111030131023 is a deficient number, since it is larger than the sum of its proper divisors (21378472625).
111030131023 is an equidigital number, since it uses as much as digits as its factorization.
111030131023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 689628173.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 111030131023 its reverse (320131030111), we get a palindrome (431161161134).
The spelling of 111030131023 in words is "one hundred eleven billion, thirty million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •