Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …000111100011010100100001 |
3 | 222101001221001200200121120111 |
4 | 231232202102013203110201 |
5 | 202324441240012333441 |
6 | 1551420354132211321 |
7 | 60234501165550240 |
oct | 5556422207432441 |
9 | 871057050617514 |
10 | 201110000121121 |
11 | 590972aa161353 |
12 | 1a680570169b41 |
13 | 882a78ca97790 |
14 | 3793ac1282957 |
15 | 183b4ec924081 |
hex | b6e8921e3521 |
201110000121121 has 8 divisors (see below), whose sum is σ = 247520000149184. Its totient is φ = 159120000095760.
The previous prime is 201110000121103. The next prime is 201110000121131. The reversal of 201110000121121 is 121121000011102.
It is a happy number.
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 201110000121121 - 29 = 201110000120609 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 (201110000121131) 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, 1105000000575 + ... + 1105000000756.
It is an arithmetic number, because the mean of its divisors is an integer number (30940000018648).
Almost surely, 2201110000121121 is an apocalyptic number.
It is an amenable number.
201110000121121 is a deficient number, since it is larger than the sum of its proper divisors (46410000028063).
201110000121121 is a wasteful number, since it uses less digits than its factorization.
201110000121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2210000001351.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201110000121121 its reverse (121121000011102), we get a palindrome (322231000132223).
The spelling of 201110000121121 in words is "two hundred one trillion, one hundred ten billion, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •