Base | Representation |
---|---|
bin | 1100010101110011101… |
… | …0011001100000100100 |
3 | 202021020111101012002221 |
4 | 3011130322121200210 |
5 | 11433200111211322 |
6 | 241221433242124 |
7 | 21213601024015 |
oct | 3053472314044 |
9 | 667214335087 |
10 | 212012210212 |
11 | 81a06402560 |
12 | 3510a563344 |
13 | 16cb9b6a57a |
14 | a39359b00c |
15 | 57acd079c7 |
hex | 315ce99824 |
212012210212 has 24 divisors (see below), whose sum is σ = 405121665312. Its totient is φ = 96280833600.
The previous prime is 212012210171. The next prime is 212012210213.
It is a happy number.
212012210212 is nontrivially palindromic in base 10.
212012210212 is digitally balanced in base 3, 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 (212012210213) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2160273 + ... + 2256280.
It is an arithmetic number, because the mean of its divisors is an integer number (16880069388).
Almost surely, 2212012210212 is an apocalyptic number.
212012210212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
212012210212 is a deficient number, since it is larger than the sum of its proper divisors (193109455100).
212012210212 is a wasteful number, since it uses less digits than its factorization.
212012210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4417659 (or 4417657 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
It can be divided in two parts, 212012 and 210212, that added together give a palindrome (422224).
The spelling of 212012210212 in words is "two hundred twelve billion, twelve million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •