Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111011101000110110110001 |
3 | 112102110220020010202101000012 |
4 | 121000231132323220312301 |
5 | 103404220000012010001 |
6 | 1025541145154104305 |
7 | 32112144355455341 |
oct | 3100553673506661 |
9 | 472426203671005 |
10 | 110000000110001 |
11 | 3205a813405901 |
12 | 104068a157b095 |
13 | 494bc5630c551 |
14 | 1d24057d6cd21 |
15 | cab5447352bb |
hex | 640b5eee8db1 |
110000000110001 has 6 divisors (see below), whose sum is σ = 113923900233702. Its totient is φ = 106206896657120.
The previous prime is 110000000109983. The next prime is 110000000110003. The reversal of 110000000110001 is 100011000000011.
It can be written as a sum of positive squares in 3 ways, for example, as 325675662400 + 109674324447601 = 570680^2 + 10472551^2 .
It is a de Polignac number, because none of the positive numbers 2k-110000000110001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110000000110003) 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, 65398334540 + ... + 65398336221.
It is an arithmetic number, because the mean of its divisors is an integer number (18987316705617).
Almost surely, 2110000000110001 is an apocalyptic number.
It is an amenable number.
110000000110001 is a deficient number, since it is larger than the sum of its proper divisors (3923900123701).
110000000110001 is an equidigital number, since it uses as much as digits as its factorization.
110000000110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130796670819 (or 130796670790 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 110000000110001 its reverse (100011000000011), we get a palindrome (210011000110012).
The spelling of 110000000110001 in words is "one hundred ten trillion, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •