Base | Representation |
---|---|
bin | 110000001101010011000000… |
… | …110010101001011010000110 |
3 | 1000210200220200100102121120012 |
4 | 300031103000302221122012 |
5 | 210242213430011231042 |
6 | 2030532350551110222 |
7 | 62441640152360420 |
oct | 6015230062513206 |
9 | 1023626610377505 |
10 | 212020000102022 |
11 | 616131a4786892 |
12 | 1b942a91072372 |
13 | 913c528390958 |
14 | 3a4db73913810 |
15 | 197a1d7c4ae82 |
hex | c0d4c0ca9686 |
212020000102022 has 16 divisors (see below), whose sum is σ = 363520213136160. Its totient is φ = 90851375374848.
The previous prime is 212020000102019. The next prime is 212020000102063. The reversal of 212020000102022 is 220201000020212.
It is a super-2 number, since 2×2120200001020222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 212020000101988 and 212020000102006.
It is a congruent number.
It is an unprimeable number.
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, 1194820997 + ... + 1194998432.
It is an arithmetic number, because the mean of its divisors is an integer number (22720013321010).
Almost surely, 2212020000102022 is an apocalyptic number.
212020000102022 is a deficient number, since it is larger than the sum of its proper divisors (151500213034138).
212020000102022 is a wasteful number, since it uses less digits than its factorization.
212020000102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2389825775.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 212020000102022 its reverse (220201000020212), we get a palindrome (432221000122234).
The spelling of 212020000102022 in words is "two hundred twelve trillion, twenty billion, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •