Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0100110101000010111001 |
3 | 1022210111222000112011200000 |
4 | 2103013301210311002321 |
5 | 2311121001404323001 |
6 | 33300304302103213 |
7 | 2062300655450061 |
oct | 223076144650271 |
9 | 38714860464600 |
10 | 10110111011001 |
11 | 3248746106361 |
12 | 11734a787ab09 |
13 | 5844c16529c1 |
14 | 26d490d6c3a1 |
15 | 127ec1b67a86 |
hex | 931f19350b9 |
10110111011001 has 12 divisors (see below), whose sum is σ = 15144363819312. Its totient is φ = 6740074007172.
The previous prime is 10110111010973. The next prime is 10110111011027. The reversal of 10110111011001 is 10011011101101.
It is not a de Polignac number, because 10110111011001 - 219 = 10110110486713 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10110111011051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20802697311 + ... + 20802697796.
It is an arithmetic number, because the mean of its divisors is an integer number (1262030318276).
Almost surely, 210110111011001 is an apocalyptic number.
It is an amenable number.
10110111011001 is a deficient number, since it is larger than the sum of its proper divisors (5034252808311).
10110111011001 is an frugal number, since it uses more digits than its factorization.
10110111011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41605395122 (or 41605395110 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10110111011001 its reverse (10011011101101), we get a palindrome (20121122112102).
It can be divided in two parts, 1011011101100 and 1, that added together give a palindrome (1011011101101).
The spelling of 10110111011001 in words is "ten trillion, one hundred ten billion, one hundred eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •