Base | Representation |
---|---|
bin | 101101101101000101010110… |
… | …010010111011000011000010 |
3 | 222100201101111022011001211101 |
4 | 231231011112102323003002 |
5 | 202321322403312033442 |
6 | 1551302452223205014 |
7 | 60224336305443133 |
oct | 5555052622730302 |
9 | 870641438131741 |
10 | 201010212221122 |
11 | 59058a52523107 |
12 | 1a66516144676a |
13 | 88212491ba9c5 |
14 | 378cd36473c8a |
15 | 1838b0c133cb7 |
hex | b6d1564bb0c2 |
201010212221122 has 4 divisors (see below), whose sum is σ = 301515318331686. Its totient is φ = 100505106110560.
The previous prime is 201010212221111. The next prime is 201010212221123. The reversal of 201010212221122 is 221122212010102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 198807715806561 + 2202496414561 = 14099919^2 + 1484081^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 201010212221122.
It is not an unprimeable number, because it can be changed into a prime (201010212221123) 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 as a sum of consecutive naturals, namely, 50252553055279 + ... + 50252553055282.
Almost surely, 2201010212221122 is an apocalyptic number.
201010212221122 is a deficient number, since it is larger than the sum of its proper divisors (100505106110564).
201010212221122 is a wasteful number, since it uses less digits than its factorization.
201010212221122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100505106110563.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 201010212221122 its reverse (221122212010102), we get a palindrome (422132424231224).
The spelling of 201010212221122 in words is "two hundred one trillion, ten billion, two hundred twelve million, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •