Base | Representation |
---|---|
bin | 10000110110110… |
… | …10000000000001 |
3 | 100212001222020022 |
4 | 20123122000001 |
5 | 242144331423 |
6 | 22010423225 |
7 | 3334620026 |
oct | 1033320001 |
9 | 325058208 |
10 | 141402113 |
11 | 728aa556 |
12 | 3b431b15 |
13 | 233ab5b8 |
14 | 14acb54d |
15 | c631dc8 |
hex | 86da001 |
141402113 has 2 divisors, whose sum is σ = 141402114. Its totient is φ = 141402112.
The previous prime is 141402101. The next prime is 141402119. The reversal of 141402113 is 311204141.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136235584 + 5166529 = 11672^2 + 2273^2 .
It is an emirp because it is prime and its reverse (311204141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141402113 - 24 = 141402097 is a prime.
It is a super-3 number, since 3×1414021133 (a number of 25 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141402091 and 141402100.
It is not a weakly prime, because it can be changed into another prime (141402119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70701056 + 70701057.
It is an arithmetic number, because the mean of its divisors is an integer number (70701057).
Almost surely, 2141402113 is an apocalyptic number.
It is an amenable number.
141402113 is a deficient number, since it is larger than the sum of its proper divisors (1).
141402113 is an equidigital number, since it uses as much as digits as its factorization.
141402113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 141402113 is about 11891.2620440389. The cubic root of 141402113 is about 520.9770989893.
Adding to 141402113 its reverse (311204141), we get a palindrome (452606254).
The spelling of 141402113 in words is "one hundred forty-one million, four hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •