Base | Representation |
---|---|
bin | 1100001110110011011… |
… | …1111110000111100101 |
3 | 202002101111102022111011 |
4 | 3003230313332013211 |
5 | 11420322411304131 |
6 | 240311125142221 |
7 | 21116164665541 |
oct | 3035467760745 |
9 | 662344368434 |
10 | 210132525541 |
11 | 81131372654 |
12 | 34884b5a971 |
13 | 16a7a5ca813 |
14 | a255aa0a21 |
15 | 56eccae0b1 |
hex | 30ecdfe1e5 |
210132525541 has 4 divisors (see below), whose sum is σ = 210134021184. Its totient is φ = 210131029900.
The previous prime is 210132525529. The next prime is 210132525563. The reversal of 210132525541 is 145525231012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 210132525541 - 217 = 210132394469 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 (210132525041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 512365 + ... + 826306.
It is an arithmetic number, because the mean of its divisors is an integer number (52533505296).
Almost surely, 2210132525541 is an apocalyptic number.
It is an amenable number.
210132525541 is a deficient number, since it is larger than the sum of its proper divisors (1495643).
210132525541 is a wasteful number, since it uses less digits than its factorization.
210132525541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495642.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 210132525541 its reverse (145525231012), we get a palindrome (355657756553).
The spelling of 210132525541 in words is "two hundred ten billion, one hundred thirty-two million, five hundred twenty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •