Base | Representation |
---|---|
bin | 10000111000010… |
… | …10111010001001 |
3 | 100212110011000212 |
4 | 20130022322021 |
5 | 242222234231 |
6 | 22015010505 |
7 | 3336413051 |
oct | 1034127211 |
9 | 325404025 |
10 | 141602441 |
11 | 72a27012 |
12 | 3b509a35 |
13 | 2344b836 |
14 | 14b40561 |
15 | c67142b |
hex | 870ae89 |
141602441 has 4 divisors (see below), whose sum is σ = 145429572. Its totient is φ = 137775312.
The previous prime is 141602429. The next prime is 141602449. The reversal of 141602441 is 144206141.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 144206141 = 31 ⋅4651811.
It can be written as a sum of positive squares in 2 ways, for example, as 118897216 + 22705225 = 10904^2 + 4765^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141602441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141602449) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1913510 + ... + 1913583.
It is an arithmetic number, because the mean of its divisors is an integer number (36357393).
Almost surely, 2141602441 is an apocalyptic number.
It is an amenable number.
141602441 is a deficient number, since it is larger than the sum of its proper divisors (3827131).
141602441 is an equidigital number, since it uses as much as digits as its factorization.
141602441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3827130.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 141602441 is about 11899.6823907195. The cubic root of 141602441 is about 521.2230101022.
Adding to 141602441 its reverse (144206141), we get a palindrome (285808582).
The spelling of 141602441 in words is "one hundred forty-one million, six hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •