Base | Representation |
---|---|
bin | 101111110000000011000100… |
… | …101001110110101000001011 |
3 | 1000112120202120101122210002112 |
4 | 233300003010221312220023 |
5 | 210011301010133224321 |
6 | 2022353134342252535 |
7 | 62143503035242643 |
oct | 5760030451665013 |
9 | 1015522511583075 |
10 | 210010020211211 |
11 | 60a08827506360 |
12 | 1b679422a2714b |
13 | 9024b2436015c |
14 | 39c0779857523 |
15 | 1942c98a33a5b |
hex | bf00c4a76a0b |
210010020211211 has 8 divisors (see below), whose sum is σ = 230129202745344. Its totient is φ = 190062064762920.
The previous prime is 210010020211183. The next prime is 210010020211261. The reversal of 210010020211211 is 112112020010012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210010020211211 - 214 = 210010020194827 is a prime.
It is a super-2 number, since 2×2100100202112112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210010020211261) 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, 42806768891 + ... + 42806773796.
It is an arithmetic number, because the mean of its divisors is an integer number (28766150343168).
Almost surely, 2210010020211211 is an apocalyptic number.
210010020211211 is a deficient number, since it is larger than the sum of its proper divisors (20119182534133).
210010020211211 is a wasteful number, since it uses less digits than its factorization.
210010020211211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85613542921.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210010020211211 its reverse (112112020010012), we get a palindrome (322122040221223).
The spelling of 210010020211211 in words is "two hundred ten trillion, ten billion, twenty million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •