Base | Representation |
---|---|
bin | 101111011111110101… |
… | …1001100101011111101 |
3 | 100202021120000220012201 |
4 | 1132333223030223331 |
5 | 3132344001121341 |
6 | 114505210231501 |
7 | 10240440603151 |
oct | 1367753145375 |
9 | 322246026181 |
10 | 102000020221 |
11 | 3a292396980 |
12 | 17927725591 |
13 | 9806c93068 |
14 | 4d18923061 |
15 | 29beb03331 |
hex | 17bfaccafd |
102000020221 has 8 divisors (see below), whose sum is σ = 111582705600. Its totient is φ = 92468994240.
The previous prime is 102000020207. The next prime is 102000020231. The reversal of 102000020221 is 122020000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102000020221 - 25 = 102000020189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102000020198 and 102000020207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000020231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12910716 + ... + 12918613.
It is an arithmetic number, because the mean of its divisors is an integer number (13947838200).
Almost surely, 2102000020221 is an apocalyptic number.
102000020221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102000020221 is a deficient number, since it is larger than the sum of its proper divisors (9582685379).
102000020221 is a wasteful number, since it uses less digits than its factorization.
102000020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25829699.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 102000020221 its reverse (122020000201), we get a palindrome (224020020422).
The spelling of 102000020221 in words is "one hundred two billion, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •