Base | Representation |
---|---|
bin | 110000000000101011… |
… | …0111010110001011101 |
3 | 100212010100121021120210 |
4 | 1200001112322301131 |
5 | 3142123103001341 |
6 | 115210413403033 |
7 | 10306651353633 |
oct | 1400126726135 |
9 | 325110537523 |
10 | 103102000221 |
11 | 3a7a8433850 |
12 | 17b94799479 |
13 | 995138802c |
14 | 4dc1019353 |
15 | 2a3672ac16 |
hex | 18015bac5d |
103102000221 has 16 divisors (see below), whose sum is σ = 150062814720. Its totient is φ = 62445948720.
The previous prime is 103102000219. The next prime is 103102000237. The reversal of 103102000221 is 122000201301.
It is not a de Polignac number, because 103102000221 - 21 = 103102000219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103102000197 and 103102000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103102000241) 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 15 ways as a sum of consecutive naturals, for example, 950575 + ... + 1053468.
It is an arithmetic number, because the mean of its divisors is an integer number (9378925920).
Almost surely, 2103102000221 is an apocalyptic number.
103102000221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103102000221 is a deficient number, since it is larger than the sum of its proper divisors (46960814499).
103102000221 is a wasteful number, since it uses less digits than its factorization.
103102000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005616.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 103102000221 its reverse (122000201301), we get a palindrome (225102201522).
The spelling of 103102000221 in words is "one hundred three billion, one hundred two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.722 sec. • engine limits •