Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …011111101011011011001001 |
3 | 112102110220111210221120220101 |
4 | 121000231211133223123021 |
5 | 103404220211204033001 |
6 | 1025541204130125401 |
7 | 32112150163421560 |
oct | 3100554537533311 |
9 | 472426453846811 |
10 | 110000110221001 |
11 | 3205a86a582930 |
12 | 10406912420861 |
13 | 494bc730832a0 |
14 | 1d24068832bd7 |
15 | cab54e235a01 |
hex | 640b657eb6c9 |
110000110221001 has 32 divisors (see below), whose sum is σ = 148241498630400. Its totient is φ = 78826828250880.
The previous prime is 110000110220999. The next prime is 110000110221013. The reversal of 110000110221001 is 100122011000011.
It is a cyclic number.
It is not a de Polignac number, because 110000110221001 - 21 = 110000110220999 is a prime.
It is a super-2 number, since 2×1100001102210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110000110221041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 203987646 + ... + 204526183.
It is an arithmetic number, because the mean of its divisors is an integer number (4632546832200).
Almost surely, 2110000110221001 is an apocalyptic number.
110000110221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110000110221001 is a deficient number, since it is larger than the sum of its proper divisors (38241388409399).
110000110221001 is a wasteful number, since it uses less digits than its factorization.
110000110221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408514129.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110000110221001 its reverse (100122011000011), we get a palindrome (210122121221012).
The spelling of 110000110221001 in words is "one hundred ten trillion, one hundred ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •