Base | Representation |
---|---|
bin | 1100010010110110110… |
… | …1100000010011110010 |
3 | 202012012022021000221200 |
4 | 3010231231200103302 |
5 | 11430034344113132 |
6 | 241011104032030 |
7 | 21155143635642 |
oct | 3045555402362 |
9 | 665168230850 |
10 | 211220301042 |
11 | 8163a398473 |
12 | 34b29302616 |
13 | 16bc1a8b26a |
14 | a31a33a522 |
15 | 576352cd7c |
hex | 312db604f2 |
211220301042 has 12 divisors (see below), whose sum is σ = 457643985630. Its totient is φ = 70406767008.
The previous prime is 211220300999. The next prime is 211220301113. The reversal of 211220301042 is 240103022112.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 107780233401 + 103440067641 = 328299^2 + 321621^2 .
It is a super-2 number, since 2×2112203010422 (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), and also a Moran number because the ratio is a prime number: 11734461169 = 211220301042 / (2 + 1 + 1 + 2 + 2 + 0 + 3 + 0 + 1 + 0 + 4 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5867230567 + ... + 5867230602.
Almost surely, 2211220301042 is an apocalyptic number.
211220301042 is an abundant number, since it is smaller than the sum of its proper divisors (246423684588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211220301042 is a wasteful number, since it uses less digits than its factorization.
211220301042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11734461177 (or 11734461174 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 211220301042 its reverse (240103022112), we get a palindrome (451323323154).
The spelling of 211220301042 in words is "two hundred eleven billion, two hundred twenty million, three hundred one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •