Base | Representation |
---|---|
bin | 101101110001011100110101… |
… | …101000110001100110110100 |
3 | 222101210002002202212000012210 |
4 | 231301130311220301212310 |
5 | 202341232004333342322 |
6 | 1552052403003213420 |
7 | 60255122124540564 |
oct | 5561346550614664 |
9 | 871702082760183 |
10 | 201310312012212 |
11 | 59164250a88987 |
12 | 1a6b3354217270 |
13 | 88436338b8ca0 |
14 | 379d684950da4 |
15 | 184182345570c |
hex | b71735a319b4 |
201310312012212 has 96 divisors (see below), whose sum is σ = 522363388739584. Its totient is φ = 59921849520000.
The previous prime is 201310312012171. The next prime is 201310312012213. The reversal of 201310312012212 is 212210213013102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201310312012213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5859087 + ... + 20903337.
Almost surely, 2201310312012212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201310312012212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261181694369792).
201310312012212 is an abundant number, since it is smaller than the sum of its proper divisors (321053076727372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201310312012212 is a wasteful number, since it uses less digits than its factorization.
201310312012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15047069 (or 15047067 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 201310312012212 its reverse (212210213013102), we get a palindrome (413520525025314).
The spelling of 201310312012212 in words is "two hundred one trillion, three hundred ten billion, three hundred twelve million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •