Base | Representation |
---|---|
bin | 10111000101101001100111… |
… | …100110110001111111110111 |
3 | 111022112110011000002110120021 |
4 | 113011221213212301333313 |
5 | 101302141242342002133 |
6 | 555544212345150011 |
7 | 30250156666355545 |
oct | 2705514746617767 |
9 | 438473130073507 |
10 | 101543355031543 |
11 | 2a39a32775a447 |
12 | b47b94818b307 |
13 | 4487660721769 |
14 | 1b10a2046cd95 |
15 | bb1597e7452d |
hex | 5c5a679b1ff7 |
101543355031543 has 2 divisors, whose sum is σ = 101543355031544. Its totient is φ = 101543355031542.
The previous prime is 101543355031529. The next prime is 101543355031589. The reversal of 101543355031543 is 345130553345101.
It is a weak prime.
It is an emirp because it is prime and its reverse (345130553345101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101543355031543 - 213 = 101543355023351 is a prime.
It is a super-2 number, since 2×1015433550315432 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101543355031543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101543355041543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50771677515771 + 50771677515772.
It is an arithmetic number, because the mean of its divisors is an integer number (50771677515772).
Almost surely, 2101543355031543 is an apocalyptic number.
101543355031543 is a deficient number, since it is larger than the sum of its proper divisors (1).
101543355031543 is an equidigital number, since it uses as much as digits as its factorization.
101543355031543 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 810000, while the sum is 43.
The spelling of 101543355031543 in words is "one hundred one trillion, five hundred forty-three billion, three hundred fifty-five million, thirty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •