Base | Representation |
---|---|
bin | 101111110000001101010100… |
… | …011010010110100000111011 |
3 | 1000112121210222010110121202020 |
4 | 233300031110122112200323 |
5 | 210011441023113014321 |
6 | 2022402154153005523 |
7 | 62144342466022311 |
oct | 5760152432264073 |
9 | 1015553863417666 |
10 | 210021022001211 |
11 | 60a12462756a93 |
12 | 1b67b5933b38a3 |
13 | 9025b88763475 |
14 | 39c1100a720b1 |
15 | 19431de8284c6 |
hex | bf035469683b |
210021022001211 has 8 divisors (see below), whose sum is σ = 280066723301904. Its totient is φ = 139994667684000.
The previous prime is 210021022001179. The next prime is 210021022001213. The reversal of 210021022001211 is 112100220120012.
210021022001211 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210021022001211 - 25 = 210021022001179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210021022001213) 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, 4836720540 + ... + 4836763961.
It is an arithmetic number, because the mean of its divisors is an integer number (35008340412738).
Almost surely, 2210021022001211 is an apocalyptic number.
210021022001211 is a deficient number, since it is larger than the sum of its proper divisors (70045701300693).
210021022001211 is an equidigital number, since it uses as much as digits as its factorization.
210021022001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9673491741.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210021022001211 its reverse (112100220120012), we get a palindrome (322121242121223).
The spelling of 210021022001211 in words is "two hundred ten trillion, twenty-one billion, twenty-two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •