Base | Representation |
---|---|
bin | 110011101100010111… |
… | …0010110000011011011 |
3 | 101121112111021221222200 |
4 | 1213120232112003123 |
5 | 3304322103210021 |
6 | 122555234021243 |
7 | 11006636134101 |
oct | 1473056260333 |
9 | 347474257880 |
10 | 111010210011 |
11 | 43096407918 |
12 | 19621117823 |
13 | a6118a03cc |
14 | 553142bc71 |
15 | 2d4ab44126 |
hex | 19d8b960db |
111010210011 has 6 divisors (see below), whose sum is σ = 160348081140. Its totient is φ = 74006806668.
The previous prime is 111010209991. The next prime is 111010210063. The reversal of 111010210011 is 110012010111.
It is not a de Polignac number, because 111010210011 - 210 = 111010208987 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 12334467779 = 111010210011 / (1 + 1 + 1 + 0 + 1 + 0 + 2 + 1 + 0 + 0 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 111010209975 and 111010210002.
It is not an unprimeable number, because it can be changed into a prime (111010210111) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6167233881 + ... + 6167233898.
It is an arithmetic number, because the mean of its divisors is an integer number (26724680190).
Almost surely, 2111010210011 is an apocalyptic number.
111010210011 is a deficient number, since it is larger than the sum of its proper divisors (49337871129).
111010210011 is a wasteful number, since it uses less digits than its factorization.
111010210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12334467785 (or 12334467782 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111010210011 its reverse (110012010111), we get a palindrome (221022220122).
The spelling of 111010210011 in words is "one hundred eleven billion, ten million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •