Base | Representation |
---|---|
bin | 101111110011001010100011… |
… | …011011010111011110000000 |
3 | 1000120100020102201122211211121 |
4 | 233303022203123113132000 |
5 | 210023303141022131430 |
6 | 2023035400325122024 |
7 | 62165124633101506 |
oct | 5763124333273600 |
9 | 1016306381584747 |
10 | 210224211130240 |
11 | 60a9065071600a |
12 | 1b6b2a3ab59314 |
13 | 903c09a6b6028 |
14 | 39cac9850c676 |
15 | 1948632c4ea7a |
hex | bf32a36d7780 |
210224211130240 has 64 divisors (see below), whose sum is σ = 504058552742160. Its totient is φ = 83840160079872.
The previous prime is 210224211130201. The next prime is 210224211130247. The reversal of 210224211130240 is 42031112422012.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210224211130247) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 487136442 + ... + 487567801.
Almost surely, 2210224211130240 is an apocalyptic number.
210224211130240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210224211130240 is an abundant number, since it is smaller than the sum of its proper divisors (293834341611920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210224211130240 is an equidigital number, since it uses as much as digits as its factorization.
210224211130240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 974704599 (or 974704587 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 210224211130240 its reverse (42031112422012), we get a palindrome (252255323552252).
The spelling of 210224211130240 in words is "two hundred ten trillion, two hundred twenty-four billion, two hundred eleven million, one hundred thirty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •