Base | Representation |
---|---|
bin | 110011111000111000… |
… | …0001001110000010001 |
3 | 101122121202102022102011 |
4 | 1213301300021300101 |
5 | 3311202102124241 |
6 | 123105034022521 |
7 | 11023225225651 |
oct | 1476160116021 |
9 | 348552368364 |
10 | 111430114321 |
11 | 43291438179 |
12 | 19719877a41 |
13 | a67a8906b6 |
14 | 55710d4361 |
15 | 2d7293a281 |
hex | 19f1c09c11 |
111430114321 has 8 divisors (see below), whose sum is σ = 117709332320. Its totient is φ = 105192343872.
The previous prime is 111430114309. The next prime is 111430114349. The reversal of 111430114321 is 123411034111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111430114321 - 231 = 109282630673 is a prime.
It is a super-2 number, since 2×1114301143212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111430114292 and 111430114301.
It is not an unprimeable number, because it can be changed into a prime (111430114351) 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, 10356360 + ... + 10367113.
It is an arithmetic number, because the mean of its divisors is an integer number (14713666540).
Almost surely, 2111430114321 is an apocalyptic number.
It is an amenable number.
111430114321 is a deficient number, since it is larger than the sum of its proper divisors (6279217999).
111430114321 is a wasteful number, since it uses less digits than its factorization.
111430114321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20723775.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 111430114321 its reverse (123411034111), we get a palindrome (234841148432).
The spelling of 111430114321 in words is "one hundred eleven billion, four hundred thirty million, one hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •