Base | Representation |
---|---|
bin | 110011010100100000… |
… | …1110010010101010011 |
3 | 101112110201120002111200 |
4 | 1212221001302111103 |
5 | 3301202230001321 |
6 | 122344010442243 |
7 | 10651051354653 |
oct | 1465101622523 |
9 | 345421502450 |
10 | 110210000211 |
11 | 42815743403 |
12 | 19439133383 |
13 | a514b75b9c |
14 | 549704a363 |
15 | 2d00779d26 |
hex | 19a9072553 |
110210000211 has 12 divisors (see below), whose sum is σ = 159198574080. Its totient is φ = 73470402000.
The previous prime is 110210000209. The next prime is 110210000233. The reversal of 110210000211 is 112000012011.
It is a happy number.
It is not a de Polignac number, because 110210000211 - 21 = 110210000209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110210000193 and 110210000202.
It is not an unprimeable number, because it can be changed into a prime (110210000261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7470 + ... + 469548.
It is an arithmetic number, because the mean of its divisors is an integer number (13266547840).
Almost surely, 2110210000211 is an apocalyptic number.
110210000211 is a deficient number, since it is larger than the sum of its proper divisors (48988573869).
110210000211 is a wasteful number, since it uses less digits than its factorization.
110210000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488586 (or 488583 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110210000211 its reverse (112000012011), we get a palindrome (222210012222).
The spelling of 110210000211 in words is "one hundred ten billion, two hundred ten million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •