Base | Representation |
---|---|
bin | 11001000011101000110111… |
… | …011000010100010000111111 |
3 | 112110012010120002211220001010 |
4 | 121003220313120110100333 |
5 | 103421014024200031421 |
6 | 1030213422110050303 |
7 | 32132526316361151 |
oct | 3103506730242077 |
9 | 473163502756033 |
10 | 110201200002111 |
11 | 32128080509779 |
12 | 10439892aa9993 |
13 | 4964c0c0b5a4a |
14 | 1d2daa3552ad1 |
15 | cb18bd1c3076 |
hex | 643a3761443f |
110201200002111 has 8 divisors (see below), whose sum is σ = 146948368045104. Its totient is φ = 73460749313600.
The previous prime is 110201200002083. The next prime is 110201200002169. The reversal of 110201200002111 is 111200002102011.
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 110201200002111 - 213 = 110201199993919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201200002181) 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 7 ways as a sum of consecutive naturals, for example, 1679300340 + ... + 1679365961.
It is an arithmetic number, because the mean of its divisors is an integer number (18368546005638).
Almost surely, 2110201200002111 is an apocalyptic number.
110201200002111 is a deficient number, since it is larger than the sum of its proper divisors (36747168042993).
110201200002111 is a wasteful number, since it uses less digits than its factorization.
110201200002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3358677241.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110201200002111 its reverse (111200002102011), we get a palindrome (221401202104122).
The spelling of 110201200002111 in words is "one hundred ten trillion, two hundred one billion, two hundred million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •