Base | Representation |
---|---|
bin | 10000110011111… |
… | …00110110111101 |
3 | 100211100120220101 |
4 | 20121330312331 |
5 | 242100124410 |
6 | 21554321101 |
7 | 3331440535 |
oct | 1031746675 |
9 | 324316811 |
10 | 141020605 |
11 | 72669960 |
12 | 3b289191 |
13 | 232a6a5b |
14 | 14a2c4c5 |
15 | c5a8d3a |
hex | 867cdbd |
141020605 has 8 divisors (see below), whose sum is σ = 184608864. Its totient is φ = 102560400.
The previous prime is 141020587. The next prime is 141020623. The reversal of 141020605 is 506020141.
It is an interprime number because it is at equal distance from previous prime (141020587) and next prime (141020623).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141020605 - 29 = 141020093 is a prime.
It is a super-2 number, since 2×1410206052 = 39773622069132050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1281951 + ... + 1282060.
It is an arithmetic number, because the mean of its divisors is an integer number (23076108).
Almost surely, 2141020605 is an apocalyptic number.
It is an amenable number.
141020605 is a deficient number, since it is larger than the sum of its proper divisors (43588259).
141020605 is a wasteful number, since it uses less digits than its factorization.
141020605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564027.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 141020605 is about 11875.2096823593. The cubic root of 141020605 is about 520.5081386454.
Adding to 141020605 its reverse (506020141), we get a palindrome (647040746).
The spelling of 141020605 in words is "one hundred forty-one million, twenty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •