Base | Representation |
---|---|
bin | 101111111110011110000110… |
… | …110011100000110010111010 |
3 | 1000200002111202211202200201010 |
4 | 233332132012303200302322 |
5 | 210124020243210014320 |
6 | 2024432324254334350 |
7 | 62305220311406610 |
oct | 5776360663406272 |
9 | 1020074684680633 |
10 | 211001120001210 |
11 | 612600884a87a0 |
12 | 1b7b95201ba3b6 |
13 | 9097421747736 |
14 | 3a16719c236b0 |
15 | 195d953c30ae0 |
hex | bfe786ce0cba |
211001120001210 has 512 divisors, whose sum is σ = 645476428800000. Its totient is φ = 42869947760640.
The previous prime is 211001120001173. The next prime is 211001120001233. The reversal of 211001120001210 is 12100021100112.
It is a super-3 number, since 3×2110011200012103 (a number of 44 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 60303262041 + ... + 60303265539.
It is an arithmetic number, because the mean of its divisors is an integer number (1260696150000).
Almost surely, 2211001120001210 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211001120001210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (322738214400000).
211001120001210 is an abundant number, since it is smaller than the sum of its proper divisors (434475308798790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211001120001210 is a wasteful number, since it uses less digits than its factorization.
211001120001210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5126.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 211001120001210 its reverse (12100021100112), we get a palindrome (223101141101322).
The spelling of 211001120001210 in words is "two hundred eleven trillion, one billion, one hundred twenty million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •