Base | Representation |
---|---|
bin | 101111110010111110010110… |
… | …100111000110110011011100 |
3 | 1000120021222121202211112121122 |
4 | 233302332112213012303130 |
5 | 210023044323431431022 |
6 | 2023025352404150112 |
7 | 62164152204411104 |
oct | 5762762647066334 |
9 | 1016258552745548 |
10 | 210211111202012 |
11 | 60a86039099048 |
12 | 1b6b03a3998338 |
13 | 903aa906c73cb |
14 | 39ca3b47b0204 |
15 | 1948117b5e742 |
hex | bf2f969c6cdc |
210211111202012 has 12 divisors (see below), whose sum is σ = 368175747230256. Its totient is φ = 105018040564800.
The previous prime is 210211111202011. The next prime is 210211111202107. The reversal of 210211111202012 is 210202111112012.
It is a super-2 number, since 2×2102111112020122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210211111202011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21878753648 + ... + 21878763255.
It is an arithmetic number, because the mean of its divisors is an integer number (30681312269188).
Almost surely, 2210211111202012 is an apocalyptic number.
It is an amenable number.
210211111202012 is a deficient number, since it is larger than the sum of its proper divisors (157964636028244).
210211111202012 is a wasteful number, since it uses less digits than its factorization.
210211111202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43757518108 (or 43757518106 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 210211111202012 its reverse (210202111112012), we get a palindrome (420413222314024).
The spelling of 210211111202012 in words is "two hundred ten trillion, two hundred eleven billion, one hundred eleven million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •