Base | Representation |
---|---|
bin | 11001000010001011101010… |
… | …001010001111111101001001 |
3 | 112102211120020101002020200111 |
4 | 121002023222022033331021 |
5 | 103412344043234033001 |
6 | 1030055431213034321 |
7 | 32122354253310520 |
oct | 3102135212177511 |
9 | 472746211066614 |
10 | 110101120221001 |
11 | 32099694041978 |
12 | 104224024859a1 |
13 | 495864cbc1760 |
14 | 1d28ccba854b7 |
15 | cadeb1e79851 |
hex | 6422ea28ff49 |
110101120221001 has 32 divisors (see below), whose sum is σ = 137615589296640. Its totient is φ = 85768561511424.
The previous prime is 110101120220999. The next prime is 110101120221007. The reversal of 110101120221001 is 100122021101011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110101120221001 - 21 = 110101120220999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (110101120221007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32328256 + ... + 35571313.
It is an arithmetic number, because the mean of its divisors is an integer number (4300487165520).
Almost surely, 2110101120221001 is an apocalyptic number.
It is an amenable number.
110101120221001 is a deficient number, since it is larger than the sum of its proper divisors (27514469075639).
110101120221001 is a wasteful number, since it uses less digits than its factorization.
110101120221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67899865.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110101120221001 its reverse (100122021101011), we get a palindrome (210223141322012).
The spelling of 110101120221001 in words is "one hundred ten trillion, one hundred one billion, one hundred twenty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •