Base | Representation |
---|---|
bin | 10010101001011001… |
… | …11110100010001011 |
3 | 221211200111001200000 |
4 | 21110230332202023 |
5 | 131000304324321 |
6 | 4333214414043 |
7 | 503040122415 |
oct | 112454764213 |
9 | 27750431600 |
10 | 10011011211 |
11 | 4277a55993 |
12 | 1b34801323 |
13 | c37074396 |
14 | 6ad7cb9b5 |
15 | 3d8d35826 |
hex | 254b3e88b |
10011011211 has 48 divisors (see below), whose sum is σ = 15728294400. Its totient is φ = 6351048000.
The previous prime is 10011011203. The next prime is 10011011237. The reversal of 10011011211 is 11211011001.
10011011211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10011011211 - 23 = 10011011203 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 = 10011011193 and 10011011202.
It is not an unprimeable number, because it can be changed into a prime (10011011201) 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 47 ways as a sum of consecutive naturals, for example, 1107711 + ... + 1116711.
It is an arithmetic number, because the mean of its divisors is an integer number (327672800).
Almost surely, 210011011211 is an apocalyptic number.
10011011211 is a deficient number, since it is larger than the sum of its proper divisors (5717283189).
10011011211 is an equidigital number, since it uses as much as digits as its factorization.
10011011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9238 (or 9226 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10011011211 its reverse (11211011001), we get a palindrome (21222022212).
The spelling of 10011011211 in words is "ten billion, eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •