Base | Representation |
---|---|
bin | 110011001110010100… |
… | …0010111100001100011 |
3 | 101111221020012002212100 |
4 | 1212130220113201203 |
5 | 3300241003311321 |
6 | 122311220501443 |
7 | 10642644442062 |
oct | 1463450274143 |
9 | 344836162770 |
10 | 110002010211 |
11 | 427192a3445 |
12 | 1939b54a883 |
13 | a4b0a51b92 |
14 | 54775881d9 |
15 | 2cdc393326 |
hex | 199ca17863 |
110002010211 has 96 divisors (see below), whose sum is σ = 175916482560. Its totient is φ = 65948193792.
The previous prime is 110002010207. The next prime is 110002010257. The reversal of 110002010211 is 112010200011.
It is a happy number.
It is not a de Polignac number, because 110002010211 - 22 = 110002010207 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 = 110002010193 and 110002010202.
It is not an unprimeable number, because it can be changed into a prime (110002010201) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 99729286 + ... + 99730388.
It is an arithmetic number, because the mean of its divisors is an integer number (1832463360).
Almost surely, 2110002010211 is an apocalyptic number.
110002010211 is a deficient number, since it is larger than the sum of its proper divisors (65914472349).
110002010211 is a wasteful number, since it uses less digits than its factorization.
110002010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1465 (or 1462 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110002010211 its reverse (112010200011), we get a palindrome (222012210222).
The spelling of 110002010211 in words is "one hundred ten billion, two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •