Base | Representation |
---|---|
bin | 100101111011000110001… |
… | …1000011001000101011001 |
3 | 200110021110201202220202111 |
4 | 1023312030120121011121 |
5 | 1140343441014100424 |
6 | 15030232350432321 |
7 | 1045364643360013 |
oct | 113661430310531 |
9 | 20407421686674 |
10 | 5212150534489 |
11 | 172a5081070a8 |
12 | 7021968026a1 |
13 | 2ba6717a3202 |
14 | 1403ab46d1b3 |
15 | 908a774e194 |
hex | 4bd8c619159 |
5212150534489 has 2 divisors, whose sum is σ = 5212150534490. Its totient is φ = 5212150534488.
The previous prime is 5212150534429. The next prime is 5212150534499. The reversal of 5212150534489 is 9844350512125.
5212150534489 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4501644837264 + 710505697225 = 2121708^2 + 842915^2 .
It is a cyclic number.
It is not a de Polignac number, because 5212150534489 - 29 = 5212150533977 is a prime.
It is a super-2 number, since 2×52121505344892 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5212150534429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2606075267244 + 2606075267245.
It is an arithmetic number, because the mean of its divisors is an integer number (2606075267245).
Almost surely, 25212150534489 is an apocalyptic number.
It is an amenable number.
5212150534489 is a deficient number, since it is larger than the sum of its proper divisors (1).
5212150534489 is an equidigital number, since it uses as much as digits as its factorization.
5212150534489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728000, while the sum is 49.
The spelling of 5212150534489 in words is "five trillion, two hundred twelve billion, one hundred fifty million, five hundred thirty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.802 sec. • engine limits •