Base | Representation |
---|---|
bin | 11001000011101000101011… |
… | …100101000000011001010001 |
3 | 112110012010001022021102221201 |
4 | 121003220223211000121101 |
5 | 103421013123003031001 |
6 | 1030213350314151201 |
7 | 32132521363403311 |
oct | 3103505345003121 |
9 | 473163038242851 |
10 | 110201002002001 |
11 | 32127a89772319 |
12 | 10439838722501 |
13 | 4964baa07bb11 |
14 | 1d2da85131441 |
15 | cb18aab11501 |
hex | 643a2b940651 |
110201002002001 has 8 divisors (see below), whose sum is σ = 112450645992960. Its totient is φ = 107957668374192.
The previous prime is 110201002001953. The next prime is 110201002002017. The reversal of 110201002002001 is 100200200102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110201002002001 - 211 = 110201001999953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110201002002071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1577555505 + ... + 1577625358.
It is an arithmetic number, because the mean of its divisors is an integer number (14056330749120).
Almost surely, 2110201002002001 is an apocalyptic number.
It is an amenable number.
110201002002001 is a deficient number, since it is larger than the sum of its proper divisors (2249643990959).
110201002002001 is an equidigital number, since it uses as much as digits as its factorization.
110201002002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3155181575.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110201002002001 its reverse (100200200102011), we get a palindrome (210401202104012).
The spelling of 110201002002001 in words is "one hundred ten trillion, two hundred one billion, two million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •