Base | Representation |
---|---|
bin | 10000001101101000000… |
… | …000010011100100101101 |
3 | 10221111210102200100220221 |
4 | 100031220000103210231 |
5 | 121223230202042201 |
6 | 2211455101411341 |
7 | 143331314662321 |
oct | 20155000234455 |
9 | 3844712610827 |
10 | 1114141440301 |
11 | 39a56088543a |
12 | 15bb17869b51 |
13 | 810a87a9c26 |
14 | 3bcd367b981 |
15 | 1deac2224a1 |
hex | 1036801392d |
1114141440301 has 8 divisors (see below), whose sum is σ = 1176589391040. Its totient is φ = 1052860741152.
The previous prime is 1114141440299. The next prime is 1114141440323. The reversal of 1114141440301 is 1030441414111.
It is a happy number.
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 1114141440301 - 21 = 1114141440299 is a prime.
It is a super-2 number, since 2×11141414403012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114141440331) 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, 291810936 + ... + 291814753.
It is an arithmetic number, because the mean of its divisors is an integer number (147073673880).
Almost surely, 21114141440301 is an apocalyptic number.
It is an amenable number.
1114141440301 is a deficient number, since it is larger than the sum of its proper divisors (62447950739).
1114141440301 is an equidigital number, since it uses as much as digits as its factorization.
1114141440301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583625795.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1114141440301 its reverse (1030441414111), we get a palindrome (2144582854412).
The spelling of 1114141440301 in words is "one trillion, one hundred fourteen billion, one hundred forty-one million, four hundred forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •