Base | Representation |
---|---|
bin | 11001010101001000011000… |
… | …010110011001001110101101 |
3 | 112121110001022110002100120211 |
4 | 121111020120112121032231 |
5 | 104100212344140403331 |
6 | 1032533542243142421 |
7 | 32315422614023452 |
oct | 3125103026311655 |
9 | 477401273070524 |
10 | 111403270247341 |
11 | 32550952860736 |
12 | 105b2849974a11 |
13 | 4a2138b571117 |
14 | 1d71d389bd829 |
15 | cd2cc49e98b1 |
hex | 6552185993ad |
111403270247341 has 2 divisors, whose sum is σ = 111403270247342. Its totient is φ = 111403270247340.
The previous prime is 111403270247317. The next prime is 111403270247411. The reversal of 111403270247341 is 143742072304111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81180928922116 + 30222341325225 = 9010046^2 + 5497485^2 .
It is a cyclic number.
It is not a de Polignac number, because 111403270247341 - 221 = 111403268150189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111403270247294 and 111403270247303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111403270247641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55701635123670 + 55701635123671.
It is an arithmetic number, because the mean of its divisors is an integer number (55701635123671).
Almost surely, 2111403270247341 is an apocalyptic number.
It is an amenable number.
111403270247341 is a deficient number, since it is larger than the sum of its proper divisors (1).
111403270247341 is an equidigital number, since it uses as much as digits as its factorization.
111403270247341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112896, while the sum is 40.
The spelling of 111403270247341 in words is "one hundred eleven trillion, four hundred three billion, two hundred seventy million, two hundred forty-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •