Base | Representation |
---|---|
bin | 1100010111011001111… |
… | …0011111101111010000 |
3 | 202022100101102012211120 |
4 | 3011312132133233100 |
5 | 11440034410301222 |
6 | 241332154042240 |
7 | 21230326404144 |
oct | 3056636375720 |
9 | 668311365746 |
10 | 212441103312 |
11 | 82106512269 |
12 | 3520a119380 |
13 | 17057987079 |
14 | a3d4523224 |
15 | 57d57c715c |
hex | 317679fbd0 |
212441103312 has 80 divisors (see below), whose sum is σ = 567507159360. Its totient is φ = 68440559616.
The previous prime is 212441103271. The next prime is 212441103331. The reversal of 212441103312 is 213301144212.
212441103312 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 452737 + ... + 793632.
It is an arithmetic number, because the mean of its divisors is an integer number (7093839492).
Almost surely, 2212441103312 is an apocalyptic number.
It is an amenable number.
212441103312 is an abundant number, since it is smaller than the sum of its proper divisors (355066056048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212441103312 is a wasteful number, since it uses less digits than its factorization.
212441103312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246500 (or 1246494 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 212441103312 its reverse (213301144212), we get a palindrome (425742247524).
The spelling of 212441103312 in words is "two hundred twelve billion, four hundred forty-one million, one hundred three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •