Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010101101110000100010001 |
3 | 222101001011102020010101201120 |
4 | 231232122311111232010101 |
5 | 202324323344240244441 |
6 | 1551412552305352453 |
7 | 60234066026200116 |
oct | 5556326525560421 |
9 | 871034366111646 |
10 | 201102001103121 |
11 | 590939749a4778 |
12 | 1a67aab9338729 |
13 | 8829ab6809631 |
14 | 3793562b9290d |
15 | 183b1d056e966 |
hex | b6e6b556e111 |
201102001103121 has 8 divisors (see below), whose sum is σ = 268136108072640. Its totient is φ = 134067947434512.
The previous prime is 201102001103077. The next prime is 201102001103131. The reversal of 201102001103121 is 121301100201102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201102001103121 - 225 = 201101967548689 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 201102001103121.
It is not an unprimeable number, because it can be changed into a prime (201102001103131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3483181 + ... + 20355258.
It is an arithmetic number, because the mean of its divisors is an integer number (33517013509080).
Almost surely, 2201102001103121 is an apocalyptic number.
It is an amenable number.
201102001103121 is a deficient number, since it is larger than the sum of its proper divisors (67034106969519).
201102001103121 is a wasteful number, since it uses less digits than its factorization.
201102001103121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26650455.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 201102001103121 its reverse (121301100201102), we get a palindrome (322403101304223).
The spelling of 201102001103121 in words is "two hundred one trillion, one hundred two billion, one million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •