Base | Representation |
---|---|
bin | 101111110010111110011100… |
… | …100000000100100101011011 |
3 | 1000120021222212122210002001222 |
4 | 233302332130200010211123 |
5 | 210023100024231134321 |
6 | 2023025410254202255 |
7 | 62164154514354530 |
oct | 5762763440044533 |
9 | 1016258778702058 |
10 | 210211210021211 |
11 | 60a86089953403 |
12 | 1b6b0410ab338b |
13 | 903aaa80165c9 |
14 | 39ca3c3974d87 |
15 | 194812167e3ab |
hex | bf2f9c80495b |
210211210021211 has 8 divisors (see below), whose sum is σ = 241023928104960. Its totient is φ = 179594128243368.
The previous prime is 210211210021181. The next prime is 210211210021223. The reversal of 210211210021211 is 112120012112012.
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 210211210021211 - 230 = 210210136279387 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210211210021211.
It is not an unprimeable number, because it can be changed into a prime (210211210021291) 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, 48909074171 + ... + 48909078468.
It is an arithmetic number, because the mean of its divisors is an integer number (30127991013120).
Almost surely, 2210211210021211 is an apocalyptic number.
210211210021211 is a deficient number, since it is larger than the sum of its proper divisors (30812718083749).
210211210021211 is an equidigital number, since it uses as much as digits as its factorization.
210211210021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97818152953.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 210211210021211 its reverse (112120012112012), we get a palindrome (322331222133223).
The spelling of 210211210021211 in words is "two hundred ten trillion, two hundred eleven billion, two hundred ten million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •