Base | Representation |
---|---|
bin | 101111011111111001… |
… | …1100001010110100101 |
3 | 100202021201010202002010 |
4 | 1132333303201112211 |
5 | 3132400030431041 |
6 | 114505325104433 |
7 | 10240465261116 |
oct | 1367763412645 |
9 | 322251122063 |
10 | 102002202021 |
11 | 3a293647115 |
12 | 179283b8119 |
13 | 9807578175 |
14 | 4d18d3020d |
15 | 29bedd4a16 |
hex | 17bfce15a5 |
102002202021 has 8 divisors (see below), whose sum is σ = 137405028544. Its totient is φ = 67300421760.
The previous prime is 102002202011. The next prime is 102002202037. The reversal of 102002202021 is 120202200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102002202021 - 27 = 102002201893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102002201988 and 102002202006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002202011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 175261225 + ... + 175261806.
It is an arithmetic number, because the mean of its divisors is an integer number (17175628568).
Almost surely, 2102002202021 is an apocalyptic number.
It is an amenable number.
102002202021 is a deficient number, since it is larger than the sum of its proper divisors (35402826523).
102002202021 is an equidigital number, since it uses as much as digits as its factorization.
102002202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350523131.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 102002202021 its reverse (120202200201), we get a palindrome (222204402222).
The spelling of 102002202021 in words is "one hundred two billion, two million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •