Base | Representation |
---|---|
bin | 101111011111110101… |
… | …1100101010110000101 |
3 | 100202021120020000202110 |
4 | 1132333223211112011 |
5 | 3132344012334341 |
6 | 114505212331233 |
7 | 10240441503465 |
oct | 1367753452605 |
9 | 322246200673 |
10 | 102000121221 |
11 | 3a292455849 |
12 | 17927773b19 |
13 | 9806cca01b |
14 | 4d1894bba5 |
15 | 29beb23216 |
hex | 17bfae5585 |
102000121221 has 32 divisors (see below), whose sum is σ = 144388326400. Its totient is φ = 63936138240.
The previous prime is 102000121187. The next prime is 102000121229. The reversal of 102000121221 is 122121000201.
It is not a de Polignac number, because 102000121221 - 29 = 102000120709 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102000121197 and 102000121206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000121229) 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 31 ways as a sum of consecutive naturals, for example, 2418765 + ... + 2460573.
It is an arithmetic number, because the mean of its divisors is an integer number (4512135200).
Almost surely, 2102000121221 is an apocalyptic number.
It is an amenable number.
102000121221 is a deficient number, since it is larger than the sum of its proper divisors (42388205179).
102000121221 is a wasteful number, since it uses less digits than its factorization.
102000121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42589.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102000121221 its reverse (122121000201), we get a palindrome (224121121422).
The spelling of 102000121221 in words is "one hundred two billion, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •