Base | Representation |
---|---|
bin | 1100001110101100000… |
… | …0111001011101010000 |
3 | 202002022022200110121121 |
4 | 3003223000321131100 |
5 | 11420241413430222 |
6 | 240304052132024 |
7 | 21115335452134 |
oct | 3035300713520 |
9 | 662268613547 |
10 | 210101311312 |
11 | 81115792972 |
12 | 34876607014 |
13 | 16a73cbbc69 |
14 | a2518973c4 |
15 | 56ea1955c7 |
hex | 30eb039750 |
210101311312 has 80 divisors (see below), whose sum is σ = 416038042000. Its totient is φ = 102757662720.
The previous prime is 210101311309. The next prime is 210101311327. The reversal of 210101311312 is 213113101012.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 4979278096 + 205122033216 = 70564^2 + 452904^2 .
It is a super-2 number, since 2×2101013113122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 196539514 + ... + 196540582.
It is an arithmetic number, because the mean of its divisors is an integer number (5200475525).
Almost surely, 2210101311312 is an apocalyptic number.
It is an amenable number.
210101311312 is a deficient number, since it is larger than the sum of its proper divisors (205936730688).
210101311312 is a wasteful number, since it uses less digits than its factorization.
210101311312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2064 (or 2058 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 210101311312 its reverse (213113101012), we get a palindrome (423214412324).
The spelling of 210101311312 in words is "two hundred ten billion, one hundred one million, three hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •