Base | Representation |
---|---|
bin | 101101101101000101010000… |
… | …001101011100010100000101 |
3 | 222100201101020012000212002120 |
4 | 231231011100031130110011 |
5 | 202321322201142334341 |
6 | 1551302434135000153 |
7 | 60224333625553602 |
oct | 5555052015342405 |
9 | 870641205025076 |
10 | 201010110121221 |
11 | 590589aa927a25 |
12 | 1a665133209059 |
13 | 8821230cc046b |
14 | 378cd26a976a9 |
15 | 1838b031b7066 |
hex | b6d15035c505 |
201010110121221 has 16 divisors (see below), whose sum is σ = 274120201845504. Its totient is φ = 130961802305984.
The previous prime is 201010110121217. The next prime is 201010110121259. The reversal of 201010110121221 is 122121011010102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201010110121221 - 22 = 201010110121217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201010110121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201010110121321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1052787570 + ... + 1052978483.
It is an arithmetic number, because the mean of its divisors is an integer number (17132512615344).
Almost surely, 2201010110121221 is an apocalyptic number.
It is an amenable number.
201010110121221 is a deficient number, since it is larger than the sum of its proper divisors (73110091724283).
201010110121221 is a wasteful number, since it uses less digits than its factorization.
201010110121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2105766780.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201010110121221 its reverse (122121011010102), we get a palindrome (323131121131323).
The spelling of 201010110121221 in words is "two hundred one trillion, ten billion, one hundred ten million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •