Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …110001101101011100100110 |
3 | 1000112120000011211101201210121 |
4 | 233233323231301231130212 |
5 | 210011133320232431042 |
6 | 2022345350413512154 |
7 | 62143103210256121 |
oct | 5757735561553446 |
9 | 1015500154351717 |
10 | 210002120202022 |
11 | 60a05443123545 |
12 | 1b6779991a265a |
13 | 90241657595c5 |
14 | 39c022a57b3b8 |
15 | 19429851da367 |
hex | befeedc6d726 |
210002120202022 has 8 divisors (see below), whose sum is σ = 315102644531136. Its totient is φ = 104967905358312.
The previous prime is 210002120201999. The next prime is 210002120202023. The reversal of 210002120202022 is 220202021200012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2100021202020222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210002120201987 and 210002120202005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002120202023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16577363433 + ... + 16577376100.
It is an arithmetic number, because the mean of its divisors is an integer number (39387830566392).
Almost surely, 2210002120202022 is an apocalyptic number.
210002120202022 is a deficient number, since it is larger than the sum of its proper divisors (105100524329114).
210002120202022 is a wasteful number, since it uses less digits than its factorization.
210002120202022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33154742702.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 210002120202022 its reverse (220202021200012), we get a palindrome (430204141402034).
The spelling of 210002120202022 in words is "two hundred ten trillion, two billion, one hundred twenty million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •