Base | Representation |
---|---|
bin | 101111110001011000111100… |
… | …001100100001001000011001 |
3 | 1000112220120112222000102110220 |
4 | 233301120330030201020121 |
5 | 210014303321321200441 |
6 | 2022503343310030253 |
7 | 62153245606333536 |
oct | 5761307414411031 |
9 | 1015816488012426 |
10 | 210102220100121 |
11 | 60a4393a990558 |
12 | 1b6932744a8389 |
13 | 9030728b7533b |
14 | 39c50049a3d8d |
15 | 19453930a9466 |
hex | bf163c321219 |
210102220100121 has 8 divisors (see below), whose sum is σ = 280138263899424. Its totient is φ = 140067161517120.
The previous prime is 210102220100093. The next prime is 210102220100137. The reversal of 210102220100121 is 121001022201012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210102220100121 - 26 = 210102220100057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210102220100121.
It is not an unprimeable number, because it can be changed into a prime (210102220100141) 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, 245806336 + ... + 246659601.
It is an arithmetic number, because the mean of its divisors is an integer number (35017282987428).
Almost surely, 2210102220100121 is an apocalyptic number.
It is an amenable number.
210102220100121 is a deficient number, since it is larger than the sum of its proper divisors (70036043799303).
210102220100121 is a wasteful number, since it uses less digits than its factorization.
210102220100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492608151.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210102220100121 its reverse (121001022201012), we get a palindrome (331103242301133).
The spelling of 210102220100121 in words is "two hundred ten trillion, one hundred two billion, two hundred twenty million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •