Base | Representation |
---|---|
bin | 1100010101110101100… |
… | …1010011101110111110 |
3 | 202021021001121212002000 |
4 | 3011131121103232332 |
5 | 11433204200004042 |
6 | 241222323043130 |
7 | 21214026632250 |
oct | 3053531235676 |
9 | 667231555060 |
10 | 212020313022 |
11 | 81a0aa372a1 |
12 | 351112104a6 |
13 | 16cbb74672b |
14 | a3946a9cd0 |
15 | 57ad8a874c |
hex | 315d653bbe |
212020313022 has 64 divisors (see below), whose sum is σ = 550986754560. Its totient is φ = 59168454912.
The previous prime is 212020312997. The next prime is 212020313041. The reversal of 212020313022 is 220313020212.
It is a super-2 number, since 2×2120203130222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 212020312986 and 212020313004.
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 31 ways as a sum of consecutive naturals, for example, 6505843 + ... + 6538350.
It is an arithmetic number, because the mean of its divisors is an integer number (8609168040).
Almost surely, 2212020313022 is an apocalyptic number.
212020313022 is an abundant number, since it is smaller than the sum of its proper divisors (338966441538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212020313022 is a wasteful number, since it uses less digits than its factorization.
212020313022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13044254 (or 13044248 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 212020313022 its reverse (220313020212), we get a palindrome (432333333234).
The spelling of 212020313022 in words is "two hundred twelve billion, twenty million, three hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •