Base | Representation |
---|---|
bin | 11001000010001011101001… |
… | …100111000100101111000001 |
3 | 112102211120012201201202211222 |
4 | 121002023221213010233001 |
5 | 103412344033404000001 |
6 | 1030055430243244425 |
7 | 32122354112034242 |
oct | 3102135147045701 |
9 | 472746181652758 |
10 | 110101111000001 |
11 | 32099689914010 |
12 | 104223bb379715 |
13 | 495864b013644 |
14 | 1d28cca764cc9 |
15 | cadeb125761b |
hex | 6422e99c4bc1 |
110101111000001 has 16 divisors (see below), whose sum is σ = 126573405763968. Its totient is φ = 94792174752000.
The previous prime is 110101110999889. The next prime is 110101111000079. The reversal of 110101111000001 is 100000111101011.
It is a de Polignac number, because none of the positive numbers 2k-110101111000001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110101111000081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2154342056 + ... + 2154393161.
It is an arithmetic number, because the mean of its divisors is an integer number (7910837860248).
Almost surely, 2110101111000001 is an apocalyptic number.
110101111000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110101111000001 is a deficient number, since it is larger than the sum of its proper divisors (16472294763967).
110101111000001 is a wasteful number, since it uses less digits than its factorization.
110101111000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4308735352.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110101111000001 its reverse (100000111101011), we get a palindrome (210101222101012).
The spelling of 110101111000001 in words is "one hundred ten trillion, one hundred one billion, one hundred eleven million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •