Base | Representation |
---|---|
bin | 101111100010111000… |
… | …0010000100101100101 |
3 | 100202112122221112011211 |
4 | 1133011300100211211 |
5 | 3133101103311323 |
6 | 114523252231421 |
7 | 10243116524110 |
oct | 1370560204545 |
9 | 322478845154 |
10 | 102102010213 |
11 | 3a334a17525 |
12 | 1795590b571 |
13 | 9822152578 |
14 | 4d282b1577 |
15 | 29c8a4c70d |
hex | 17c5c10965 |
102102010213 has 8 divisors (see below), whose sum is σ = 117241037120. Its totient is φ = 87101239680.
The previous prime is 102102010207. The next prime is 102102010249. The reversal of 102102010213 is 312010201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102102010213 - 25 = 102102010181 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102102010193 and 102102010202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102010313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34562508 + ... + 34565461.
It is an arithmetic number, because the mean of its divisors is an integer number (14655129640).
Almost surely, 2102102010213 is an apocalyptic number.
It is an amenable number.
102102010213 is a deficient number, since it is larger than the sum of its proper divisors (15139026907).
102102010213 is an equidigital number, since it uses as much as digits as its factorization.
102102010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69128187.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 102102010213 its reverse (312010201201), we get a palindrome (414112211414).
The spelling of 102102010213 in words is "one hundred two billion, one hundred two million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •