Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …100101110010100101010011 |
3 | 112102211112221200200110012000 |
4 | 121002023203211302211103 |
5 | 103412343332030001321 |
6 | 1030055412234405043 |
7 | 32122351444406226 |
oct | 3102134345624523 |
9 | 472745850613160 |
10 | 110101010000211 |
11 | 320996378aa40a |
12 | 10422391590783 |
13 | 495863310ca59 |
14 | 1d28cbb1935bd |
15 | cadea7456826 |
hex | 6422e3972953 |
110101010000211 has 32 divisors (see below), whose sum is σ = 163361201118720. Its totient is φ = 73288841344992.
The previous prime is 110101010000207. The next prime is 110101010000227. The reversal of 110101010000211 is 112000010101011.
It is not a de Polignac number, because 110101010000211 - 22 = 110101010000207 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 = 110101010000193 and 110101010000202.
It is not an unprimeable number, because it can be changed into a prime (110101010005211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 112919400 + ... + 113890266.
It is an arithmetic number, because the mean of its divisors is an integer number (5105037534960).
Almost surely, 2110101010000211 is an apocalyptic number.
110101010000211 is a deficient number, since it is larger than the sum of its proper divisors (53260191118509).
110101010000211 is an equidigital number, since it uses as much as digits as its factorization.
110101010000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 977272 (or 977266 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110101010000211 its reverse (112000010101011), we get a palindrome (222101020101222).
The spelling of 110101010000211 in words is "one hundred ten trillion, one hundred one billion, ten million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •