Base | Representation |
---|---|
bin | 101000001010… |
… | …110101011101 |
3 | 201210222122020 |
4 | 220022311131 |
5 | 10143431031 |
6 | 1013410353 |
7 | 155335056 |
oct | 50126535 |
9 | 21728566 |
10 | 10530141 |
11 | 5a424a6 |
12 | 36399b9 |
13 | 2248c6b |
14 | 158172d |
15 | dd0096 |
hex | a0ad5d |
10530141 has 8 divisors (see below), whose sum is σ = 14366880. Its totient is φ = 6856752.
The previous prime is 10530137. The next prime is 10530151. The reversal of 10530141 is 14103501.
10530141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10530141 - 22 = 10530137 is a prime.
It is a super-2 number, since 2×105301412 = 221767738959762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10530141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10530151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40686 + ... + 40943.
It is an arithmetic number, because the mean of its divisors is an integer number (1795860).
Almost surely, 210530141 is an apocalyptic number.
It is an amenable number.
10530141 is a deficient number, since it is larger than the sum of its proper divisors (3836739).
10530141 is an equidigital number, since it uses as much as digits as its factorization.
10530141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81675.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 10530141 is about 3245.0178736025. The cubic root of 10530141 is about 219.1852855330.
Adding to 10530141 its reverse (14103501), we get a palindrome (24633642).
The spelling of 10530141 in words is "ten million, five hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •