Base | Representation |
---|---|
bin | 101000001010… |
… | …110101011111 |
3 | 201210222122022 |
4 | 220022311133 |
5 | 10143431033 |
6 | 1013410355 |
7 | 155335061 |
oct | 50126537 |
9 | 21728568 |
10 | 10530143 |
11 | 5a424a8 |
12 | 36399bb |
13 | 2248c70 |
14 | 1581731 |
15 | dd0098 |
hex | a0ad5f |
10530143 has 8 divisors (see below), whose sum is σ = 11533200. Its totient is φ = 9554688.
The previous prime is 10530137. The next prime is 10530151. The reversal of 10530143 is 34103501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10530143 - 216 = 10464607 is a prime.
It is a super-2 number, since 2×105301432 = 221767823200898, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10530133) 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 in 7 ways as a sum of consecutive naturals, for example, 6098 + ... + 7631.
It is an arithmetic number, because the mean of its divisors is an integer number (1441650).
Almost surely, 210530143 is an apocalyptic number.
10530143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10530143 is a deficient number, since it is larger than the sum of its proper divisors (1003057).
10530143 is a wasteful number, since it uses less digits than its factorization.
10530143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13801.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 10530143 is about 3245.0181817672. The cubic root of 10530143 is about 219.1852994097.
Adding to 10530143 its reverse (34103501), we get a palindrome (44633644).
The spelling of 10530143 in words is "ten million, five hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •