Base | Representation |
---|---|
bin | 101101101101001110100100… |
… | …111001111111101100011100 |
3 | 222100202100001212022021012022 |
4 | 231231032210321333230130 |
5 | 202322003201440134322 |
6 | 1551311211351155312 |
7 | 60225136665034133 |
oct | 5555164471775434 |
9 | 870670055267168 |
10 | 201020121021212 |
11 | 59062177807299 |
12 | 1a667067975b38 |
13 | 882216802601c |
14 | 378d5d645691a |
15 | 1838edbec9942 |
hex | b6d3a4e7fb1c |
201020121021212 has 6 divisors (see below), whose sum is σ = 351785211787128. Its totient is φ = 100510060510604.
The previous prime is 201020121021179. The next prime is 201020121021217. The reversal of 201020121021212 is 212120121020102.
It is a super-2 number, since 2×2010201210212122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201020121021217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25127515127648 + ... + 25127515127655.
It is an arithmetic number, because the mean of its divisors is an integer number (58630868631188).
Almost surely, 2201020121021212 is an apocalyptic number.
It is an amenable number.
201020121021212 is a deficient number, since it is larger than the sum of its proper divisors (150765090765916).
201020121021212 is a wasteful number, since it uses less digits than its factorization.
201020121021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50255030255307 (or 50255030255305 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201020121021212 its reverse (212120121020102), we get a palindrome (413140242041314).
The spelling of 201020121021212 in words is "two hundred one trillion, twenty billion, one hundred twenty-one million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •