Base | Representation |
---|---|
bin | 101111110001100000001100… |
… | …100100011111000010001011 |
3 | 1000112221022122220222201022111 |
4 | 233301200030210133002023 |
5 | 210014420300304324321 |
6 | 2022511112340203151 |
7 | 62153642641103203 |
oct | 5761401444370213 |
9 | 1015838586881274 |
10 | 210110011011211 |
11 | 60a47178728353 |
12 | 1b6948896994b7 |
13 | 903139ac9b1bc |
14 | 39c55435a1403 |
15 | 194569c0525e1 |
hex | bf180c91f08b |
210110011011211 has 4 divisors (see below), whose sum is σ = 221168432643400. Its totient is φ = 199051589379024.
The previous prime is 210110011011209. The next prime is 210110011011217. The reversal of 210110011011211 is 112110110011012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210110011011211 - 21 = 210110011011209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210110011011191 and 210110011011200.
It is not an unprimeable number, because it can be changed into a prime (210110011011217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5529210816066 + ... + 5529210816103.
It is an arithmetic number, because the mean of its divisors is an integer number (55292108160850).
Almost surely, 2210110011011211 is an apocalyptic number.
210110011011211 is a deficient number, since it is larger than the sum of its proper divisors (11058421632189).
210110011011211 is a wasteful number, since it uses less digits than its factorization.
210110011011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11058421632188.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 210110011011211 its reverse (112110110011012), we get a palindrome (322220121022223).
The spelling of 210110011011211 in words is "two hundred ten trillion, one hundred ten billion, eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •