Base | Representation |
---|---|
bin | 10000111000011… |
… | …01101010001101 |
3 | 100212110201111012 |
4 | 20130031222031 |
5 | 242223114314 |
6 | 22015135005 |
7 | 3336460646 |
oct | 1034155215 |
9 | 325421435 |
10 | 141613709 |
11 | 72a34526 |
12 | 3b514465 |
13 | 234539c3 |
14 | 14b446cd |
15 | c67493e |
hex | 870da8d |
141613709 has 2 divisors, whose sum is σ = 141613710. Its totient is φ = 141613708.
The previous prime is 141613613. The next prime is 141613711. The reversal of 141613709 is 907316141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125372809 + 16240900 = 11197^2 + 4030^2 .
It is a cyclic number.
It is not a de Polignac number, because 141613709 - 220 = 140565133 is a prime.
It is a Sophie Germain prime.
Together with 141613711, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141613799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70806854 + 70806855.
It is an arithmetic number, because the mean of its divisors is an integer number (70806855).
Almost surely, 2141613709 is an apocalyptic number.
It is an amenable number.
141613709 is a deficient number, since it is larger than the sum of its proper divisors (1).
141613709 is an equidigital number, since it uses as much as digits as its factorization.
141613709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The square root of 141613709 is about 11900.1558393157. The cubic root of 141613709 is about 521.2368351583.
The spelling of 141613709 in words is "one hundred forty-one million, six hundred thirteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •