Base | Representation |
---|---|
bin | 101111110011000110101001… |
… | …101011110000000001001110 |
3 | 1000120022211121201102022211222 |
4 | 233303012221223300001032 |
5 | 210023221100401333402 |
6 | 2023033424450443342 |
7 | 62164616044441436 |
oct | 5763065153600116 |
9 | 1016284551368758 |
10 | 210220021121102 |
11 | 60a898a0553143 |
12 | 1b6b206b893552 |
13 | 903b8805c7995 |
14 | 39ca9bbc572c6 |
15 | 1948489e957a2 |
hex | bf31a9af004e |
210220021121102 has 8 divisors (see below), whose sum is σ = 315339370191216. Its totient is φ = 105106897724032.
The previous prime is 210220021121063. The next prime is 210220021121141. The reversal of 210220021121102 is 201121120022012.
210220021121102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (210220021121063) and next prime (210220021121141).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1556333843 + ... + 1556468910.
It is an arithmetic number, because the mean of its divisors is an integer number (39417421273902).
Almost surely, 2210220021121102 is an apocalyptic number.
210220021121102 is a deficient number, since it is larger than the sum of its proper divisors (105119349070114).
210220021121102 is a wasteful number, since it uses less digits than its factorization.
210220021121102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3112836522.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 210220021121102 its reverse (201121120022012), we get a palindrome (411341141143114).
The spelling of 210220021121102 in words is "two hundred ten trillion, two hundred twenty billion, twenty-one million, one hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •