Base | Representation |
---|---|
bin | 10111000101101001100111… |
… | …100110101111111111110111 |
3 | 111022112110011000002001022212 |
4 | 113011221213212233333313 |
5 | 101302141242341221401 |
6 | 555544212345044035 |
7 | 30250156666322633 |
oct | 2705514746577767 |
9 | 438473130061285 |
10 | 101543355023351 |
11 | 2a39a32775427a |
12 | b47b94818661b |
13 | 448766071ab07 |
14 | 1b10a20469dc3 |
15 | bb1597e71dbb |
hex | 5c5a679afff7 |
101543355023351 has 2 divisors, whose sum is σ = 101543355023352. Its totient is φ = 101543355023350.
The previous prime is 101543355023323. The next prime is 101543355023381. The reversal of 101543355023351 is 153320553345101.
It is a weak prime.
It is an emirp because it is prime and its reverse (153320553345101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101543355023351 - 226 = 101543287914487 is a prime.
It is a super-2 number, since 2×1015433550233512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101543355023299 and 101543355023308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101543355023381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50771677511675 + 50771677511676.
It is an arithmetic number, because the mean of its divisors is an integer number (50771677511676).
Almost surely, 2101543355023351 is an apocalyptic number.
101543355023351 is a deficient number, since it is larger than the sum of its proper divisors (1).
101543355023351 is an equidigital number, since it uses as much as digits as its factorization.
101543355023351 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 405000, while the sum is 41.
The spelling of 101543355023351 in words is "one hundred one trillion, five hundred forty-three billion, three hundred fifty-five million, twenty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •