Base | Representation |
---|---|
bin | 10111000101100101001111… |
… | …000011010001101000000101 |
3 | 111022111222222222011202001101 |
4 | 113011211033003101220011 |
5 | 101302102122403302204 |
6 | 555542113323300101 |
7 | 30246632233214215 |
oct | 2705451703215005 |
9 | 438458888152041 |
10 | 101538648103429 |
11 | 2a398331824709 |
12 | b47aa5397a631 |
13 | 44870905063b4 |
14 | 1b106d529a245 |
15 | bb13beb0dea4 |
hex | 5c594f0d1a05 |
101538648103429 has 2 divisors, whose sum is σ = 101538648103430. Its totient is φ = 101538648103428.
The previous prime is 101538648103357. The next prime is 101538648103441. The reversal of 101538648103429 is 924301846835101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61525559255329 + 40013088848100 = 7843823^2 + 6325590^2 .
It is a cyclic number.
It is not a de Polignac number, because 101538648103429 - 225 = 101538614548997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101538648103429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101538648103729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50769324051714 + 50769324051715.
It is an arithmetic number, because the mean of its divisors is an integer number (50769324051715).
Almost surely, 2101538648103429 is an apocalyptic number.
It is an amenable number.
101538648103429 is a deficient number, since it is larger than the sum of its proper divisors (1).
101538648103429 is an equidigital number, since it uses as much as digits as its factorization.
101538648103429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4976640, while the sum is 55.
The spelling of 101538648103429 in words is "one hundred one trillion, five hundred thirty-eight billion, six hundred forty-eight million, one hundred three thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •