Base | Representation |
---|---|
bin | 10111000100001011101111… |
… | …010010001100010011011101 |
3 | 111022011210221212122000111001 |
4 | 113010023233102030103131 |
5 | 101244013321320324131 |
6 | 555430022021030301 |
7 | 30236661002640622 |
oct | 2704135722142335 |
9 | 438153855560431 |
10 | 101442552120541 |
11 | 2a3605aa085435 |
12 | b4642b5555391 |
13 | 447acb7780168 |
14 | 1b09bba926349 |
15 | badb484da261 |
hex | 5c42ef48c4dd |
101442552120541 has 2 divisors, whose sum is σ = 101442552120542. Its totient is φ = 101442552120540.
The previous prime is 101442552120527. The next prime is 101442552120571. The reversal of 101442552120541 is 145021255244101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 63911870360100 + 37530681760441 = 7994490^2 + 6126229^2 .
It is a cyclic number.
It is not a de Polignac number, because 101442552120541 - 235 = 101408192382173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101442552120541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101442552120571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50721276060270 + 50721276060271.
It is an arithmetic number, because the mean of its divisors is an integer number (50721276060271).
Almost surely, 2101442552120541 is an apocalyptic number.
It is an amenable number.
101442552120541 is a deficient number, since it is larger than the sum of its proper divisors (1).
101442552120541 is an equidigital number, since it uses as much as digits as its factorization.
101442552120541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64000, while the sum is 37.
The spelling of 101442552120541 in words is "one hundred one trillion, four hundred forty-two billion, five hundred fifty-two million, one hundred twenty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •