Base | Representation |
---|---|
bin | 101111110011000110101111… |
… | …000110110011101010110101 |
3 | 1000120022211212001121112110120 |
4 | 233303012233012303222311 |
5 | 210023221242144200041 |
6 | 2023033441500442153 |
7 | 62164621230652212 |
oct | 5763065706635265 |
9 | 1016284761545416 |
10 | 210220112100021 |
11 | 60a89937942a31 |
12 | 1b6b2096249359 |
13 | 903b89640036a |
14 | 39ca9c9d7ab09 |
15 | 1948492e67366 |
hex | bf31af1b3ab5 |
210220112100021 has 8 divisors (see below), whose sum is σ = 280293578589504. Its totient is φ = 140146693505280.
The previous prime is 210220112100001. The next prime is 210220112100059. The reversal of 210220112100021 is 120001211022012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210220112100021 - 215 = 210220112067253 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210220112100001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30316 + ... + 20504661.
It is an arithmetic number, because the mean of its divisors is an integer number (35036697323688).
Almost surely, 2210220112100021 is an apocalyptic number.
It is an amenable number.
210220112100021 is a deficient number, since it is larger than the sum of its proper divisors (70073466489483).
210220112100021 is a wasteful number, since it uses less digits than its factorization.
210220112100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23947371.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210220112100021 its reverse (120001211022012), we get a palindrome (330221323122033).
The spelling of 210220112100021 in words is "two hundred ten trillion, two hundred twenty billion, one hundred twelve million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •