Base | Representation |
---|---|
bin | 101101101101001110100011… |
… | …101110011000110100111100 |
3 | 222100202100000111000022021020 |
4 | 231231032203232120310330 |
5 | 202322003131401414322 |
6 | 1551311205402304140 |
7 | 60225136334414646 |
oct | 5555164356306474 |
9 | 870670014008236 |
10 | 201020101201212 |
11 | 590621675aa227 |
12 | 1a6670611b8050 |
13 | 8822163ba6807 |
14 | 378d5d3977896 |
15 | 1838eda3b205c |
hex | b6d3a3b98d3c |
201020101201212 has 48 divisors (see below), whose sum is σ = 485275774788000. Its totient is φ = 64688812410880.
The previous prime is 201020101201207. The next prime is 201020101201247. The reversal of 201020101201212 is 212102101020102.
It is a junction number, because it is equal to n+sod(n) for n = 201020101201191 and 201020101201200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29559489 + ... + 35718392.
It is an arithmetic number, because the mean of its divisors is an integer number (10109911974750).
Almost surely, 2201020101201212 is an apocalyptic number.
It is an amenable number.
201020101201212 is an abundant number, since it is smaller than the sum of its proper divisors (284255673586788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201020101201212 is a wasteful number, since it uses less digits than its factorization.
201020101201212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65286766 (or 65286764 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201020101201212 its reverse (212102101020102), we get a palindrome (413122202221314).
The spelling of 201020101201212 in words is "two hundred one trillion, twenty billion, one hundred one million, two hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •