Base | Representation |
---|---|
bin | 101111111101001011001110… |
… | …101111001110110000100001 |
3 | 1000122210000002011010112020012 |
4 | 233331023032233032300201 |
5 | 210121041021411300324 |
6 | 2024323410204054305 |
7 | 62265620155344662 |
oct | 5775131657166041 |
9 | 1018700064115205 |
10 | 210912132525089 |
11 | 612263733848a6 |
12 | 1b7a4226534395 |
13 | 908bc0c628c18 |
14 | 3a122b75b3369 |
15 | 195b49670b20e |
hex | bfd2cebcec21 |
210912132525089 has 4 divisors (see below), whose sum is σ = 211537984550724. Its totient is φ = 210286280499456.
The previous prime is 210912132525067. The next prime is 210912132525097. The reversal of 210912132525089 is 980525231219012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 109797704833600 + 101114427691489 = 10478440^2 + 10055567^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210912132525089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210912132525389) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 312926012312 + ... + 312926012985.
It is an arithmetic number, because the mean of its divisors is an integer number (52884496137681).
Almost surely, 2210912132525089 is an apocalyptic number.
It is an amenable number.
210912132525089 is a deficient number, since it is larger than the sum of its proper divisors (625852025635).
210912132525089 is an equidigital number, since it uses as much as digits as its factorization.
210912132525089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 625852025634.
The product of its (nonzero) digits is 777600, while the sum is 50.
The spelling of 210912132525089 in words is "two hundred ten trillion, nine hundred twelve billion, one hundred thirty-two million, five hundred twenty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •