Base | Representation |
---|---|
bin | 1100001011001… |
… | …10001000011001 |
3 | 21010011202022001 |
4 | 12011212020121 |
5 | 202121131301 |
6 | 14045001001 |
7 | 2350043455 |
oct | 605461031 |
9 | 233152261 |
10 | 102130201 |
11 | 52716a28 |
12 | 2a253161 |
13 | 1820b294 |
14 | d7c7665 |
15 | 8e75c01 |
hex | 6166219 |
102130201 has 4 divisors (see below), whose sum is σ = 104303232. Its totient is φ = 99957172.
The previous prime is 102130153. The next prime is 102130207. The reversal of 102130201 is 102031201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 102031201 = 53 ⋅1925117.
It is a cyclic number.
It is not a de Polignac number, because 102130201 - 211 = 102128153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102130207) 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 in 3 ways as a sum of consecutive naturals, for example, 1086445 + ... + 1086538.
It is an arithmetic number, because the mean of its divisors is an integer number (26075808).
Almost surely, 2102130201 is an apocalyptic number.
It is an amenable number.
102130201 is a deficient number, since it is larger than the sum of its proper divisors (2173031).
102130201 is an equidigital number, since it uses as much as digits as its factorization.
102130201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2173030.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 102130201 is about 10105.9487926666. The cubic root of 102130201 is about 467.4315928390.
Adding to 102130201 its reverse (102031201), we get a palindrome (204161402).
The spelling of 102130201 in words is "one hundred two million, one hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •