Base | Representation |
---|---|
bin | 10111000101101001100111… |
… | …100110110100011100000111 |
3 | 111022112110011000002222021122 |
4 | 113011221213212310130013 |
5 | 101302141242342312133 |
6 | 555544212345304155 |
7 | 30250156666426652 |
oct | 2705514746643407 |
9 | 438473130088248 |
10 | 101543355041543 |
11 | 2a39a327766a08 |
12 | b47b94819505b |
13 | 448766072618c |
14 | 1b10a20472899 |
15 | bb1597e77498 |
hex | 5c5a679b4707 |
101543355041543 has 2 divisors, whose sum is σ = 101543355041544. Its totient is φ = 101543355041542.
The previous prime is 101543355041521. The next prime is 101543355041561. The reversal of 101543355041543 is 345140553345101.
It is a strong prime.
It is an emirp because it is prime and its reverse (345140553345101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101543355041543 - 214 = 101543355025159 is a prime.
It is a super-2 number, since 2×1015433550415432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101543355041494 and 101543355041503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101543355041563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50771677520771 + 50771677520772.
It is an arithmetic number, because the mean of its divisors is an integer number (50771677520772).
Almost surely, 2101543355041543 is an apocalyptic number.
101543355041543 is a deficient number, since it is larger than the sum of its proper divisors (1).
101543355041543 is an equidigital number, since it uses as much as digits as its factorization.
101543355041543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080000, while the sum is 44.
The spelling of 101543355041543 in words is "one hundred one trillion, five hundred forty-three billion, three hundred fifty-five million, forty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •