Base | Representation |
---|---|
bin | 101111110001110101110010… |
… | …110100000100101010100101 |
3 | 1000120000112112002102212121201 |
4 | 233301311302310010222211 |
5 | 210020310244002210041 |
6 | 2022525505430442501 |
7 | 62155423421406235 |
oct | 5761656264045245 |
9 | 1016015462385551 |
10 | 210133201210021 |
11 | 60a55a98a15a11 |
12 | 1b69927bb03431 |
13 | 903362559242b |
14 | 39c670343dcc5 |
15 | 19460a7dd2631 |
hex | bf1d72d04aa5 |
210133201210021 has 8 divisors (see below), whose sum is σ = 213014201200704. Its totient is φ = 207252267786720.
The previous prime is 210133201209991. The next prime is 210133201210081. The reversal of 210133201210021 is 120012102331012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210133201210021 - 223 = 210133192821413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210133201210081) 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, 10268551 + ... + 22928356.
It is an arithmetic number, because the mean of its divisors is an integer number (26626775150088).
Almost surely, 2210133201210021 is an apocalyptic number.
It is an amenable number.
210133201210021 is a deficient number, since it is larger than the sum of its proper divisors (2880999990683).
210133201210021 is an equidigital number, since it uses as much as digits as its factorization.
210133201210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33283691.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 210133201210021 its reverse (120012102331012), we get a palindrome (330145303541033).
The spelling of 210133201210021 in words is "two hundred ten trillion, one hundred thirty-three billion, two hundred one million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •