Base | Representation |
---|---|
bin | 101111010001111100… |
… | …1101001111001100001 |
3 | 100201002002020001021102 |
4 | 1132203321221321201 |
5 | 3130420204012331 |
6 | 114351043004145 |
7 | 10223052111122 |
oct | 1364371517141 |
9 | 321062201242 |
10 | 101534047841 |
11 | 3a073360a36 |
12 | 17817669655 |
13 | 9761593265 |
14 | 4cb2aa8049 |
15 | 2993c5c4cb |
hex | 17a3e69e61 |
101534047841 has 2 divisors, whose sum is σ = 101534047842. Its totient is φ = 101534047840.
The previous prime is 101534047819. The next prime is 101534047871. The reversal of 101534047841 is 148740435101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96552511441 + 4981536400 = 310729^2 + 70580^2 .
It is an emirp because it is prime and its reverse (148740435101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101534047841 is a prime.
It is a super-2 number, since 2×1015340478412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101534047795 and 101534047804.
It is not a weakly prime, because it can be changed into another prime (101534047871) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50767023920 + 50767023921.
It is an arithmetic number, because the mean of its divisors is an integer number (50767023921).
Almost surely, 2101534047841 is an apocalyptic number.
It is an amenable number.
101534047841 is a deficient number, since it is larger than the sum of its proper divisors (1).
101534047841 is an equidigital number, since it uses as much as digits as its factorization.
101534047841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760, while the sum is 38.
The spelling of 101534047841 in words is "one hundred one billion, five hundred thirty-four million, forty-seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •