Base | Representation |
---|---|
bin | 1100011101100… |
… | …00000100011001 |
3 | 21021200200110221 |
4 | 12032300010121 |
5 | 203224431301 |
6 | 14212240041 |
7 | 2406330526 |
oct | 616600431 |
9 | 237620427 |
10 | 104530201 |
11 | 540060a6 |
12 | 2b010021 |
13 | 1886b7b9 |
14 | dc5014d |
15 | 929bda1 |
hex | 63b0119 |
104530201 has 2 divisors, whose sum is σ = 104530202. Its totient is φ = 104530200.
The previous prime is 104530189. The next prime is 104530213. The reversal of 104530201 is 102035401.
It is a balanced prime because it is at equal distance from previous prime (104530189) and next prime (104530213).
It can be written as a sum of positive squares in only one way, i.e., 104530176 + 25 = 10224^2 + 5^2 .
It is a cyclic number.
It is not a de Polignac number, because 104530201 - 25 = 104530169 is a prime.
It is a super-2 number, since 2×1045302012 = 21853125842200802, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104530901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52265100 + 52265101.
It is an arithmetic number, because the mean of its divisors is an integer number (52265101).
Almost surely, 2104530201 is an apocalyptic number.
It is an amenable number.
104530201 is a deficient number, since it is larger than the sum of its proper divisors (1).
104530201 is an equidigital number, since it uses as much as digits as its factorization.
104530201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 104530201 is about 10224.0012226134. The cubic root of 104530201 is about 471.0647371736.
Adding to 104530201 its reverse (102035401), we get a palindrome (206565602).
The spelling of 104530201 in words is "one hundred four million, five hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •