Base | Representation |
---|---|
bin | 101111110001110101000011… |
… | …111001111110111001111101 |
3 | 1000120000110111020121011011202 |
4 | 233301311003321332321331 |
5 | 210020302141020331031 |
6 | 2022525255355025245 |
7 | 62155365054241244 |
oct | 5761650371767175 |
9 | 1016013436534152 |
10 | 210132414230141 |
11 | 60a55724768317 |
12 | 1b6990a043b225 |
13 | 903352b51a970 |
14 | 39c666ab0395b |
15 | 194605dc7d2cb |
hex | bf1d43e7ee7d |
210132414230141 has 8 divisors (see below), whose sum is σ = 226515938296704. Its totient is φ = 193780246192560.
The previous prime is 210132414230071. The next prime is 210132414230143. The reversal of 210132414230141 is 141032414231012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210132414230141 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 (210132414230143) 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, 7838993321 + ... + 7839020126.
It is an arithmetic number, because the mean of its divisors is an integer number (28314492287088).
Almost surely, 2210132414230141 is an apocalyptic number.
It is an amenable number.
210132414230141 is a deficient number, since it is larger than the sum of its proper divisors (16383524066563).
210132414230141 is a wasteful number, since it uses less digits than its factorization.
210132414230141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15678014491.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 210132414230141 its reverse (141032414231012), we get a palindrome (351164828461153).
The spelling of 210132414230141 in words is "two hundred ten trillion, one hundred thirty-two billion, four hundred fourteen million, two hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •