Base | Representation |
---|---|
bin | 101111110000000011001111… |
… | …011100010100000101001011 |
3 | 1000112120210001000020112102020 |
4 | 233300003033130110011023 |
5 | 210011301343002224321 |
6 | 2022353204325535523 |
7 | 62143510363564512 |
oct | 5760031734240513 |
9 | 1015523030215366 |
10 | 210010201211211 |
11 | 60a0890a6a1335 |
12 | 1b6794735745a3 |
13 | 9024b529c424b |
14 | 39c07958d1679 |
15 | 1942ca98884c6 |
hex | bf00cf71414b |
210010201211211 has 16 divisors (see below), whose sum is σ = 280372334546304. Its totient is φ = 139827438068544.
The previous prime is 210010201211207. The next prime is 210010201211249. The reversal of 210010201211211 is 112112102010012.
It is a happy number.
It is not a de Polignac number, because 210010201211211 - 22 = 210010201211207 is a prime.
It is a super-2 number, since 2×2100102012112112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210010201211201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254829231 + ... + 255652023.
It is an arithmetic number, because the mean of its divisors is an integer number (17523270909144).
Almost surely, 2210010201211211 is an apocalyptic number.
210010201211211 is a deficient number, since it is larger than the sum of its proper divisors (70362133335093).
210010201211211 is a wasteful number, since it uses less digits than its factorization.
210010201211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 931690.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 210010201211211 its reverse (112112102010012), we get a palindrome (322122303221223).
The spelling of 210010201211211 in words is "two hundred ten trillion, ten billion, two hundred one million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •