Base | Representation |
---|---|
bin | 1100010111000011000… |
… | …1111101101000101100 |
3 | 202022002201121021000121 |
4 | 3011300301331220230 |
5 | 11434340424340322 |
6 | 241314501534324 |
7 | 21225056223235 |
oct | 3056061755054 |
9 | 668081537017 |
10 | 212345543212 |
11 | 82067583580 |
12 | 351a21143a4 |
13 | 17040c3942a |
14 | a3c596a08c |
15 | 57cc1ecec7 |
hex | 3170c7da2c |
212345543212 has 24 divisors (see below), whose sum is σ = 405643815360. Its totient is φ = 96459542160.
The previous prime is 212345543203. The next prime is 212345543213.
212345543212 is nontrivially palindromic in base 10.
212345543212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (212345543213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1458718 + ... + 1597669.
It is an arithmetic number, because the mean of its divisors is an integer number (16901825640).
Almost surely, 2212345543212 is an apocalyptic number.
212345543212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
212345543212 is a deficient number, since it is larger than the sum of its proper divisors (193298272148).
212345543212 is a wasteful number, since it uses less digits than its factorization.
212345543212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3057981 (or 3057979 counting only the distinct ones).
The product of its digits is 57600, while the sum is 34.
It can be divided in two parts, 212345 and 543212, that added together give a palindrome (755557).
The spelling of 212345543212 in words is "two hundred twelve billion, three hundred forty-five million, five hundred forty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •