Base | Representation |
---|---|
bin | 101111010010110011… |
… | …0010110110000001001 |
3 | 100201011001211202102212 |
4 | 1132211212112300021 |
5 | 3131000002334423 |
6 | 114353541434505 |
7 | 10223546241533 |
oct | 1364546266011 |
9 | 321131752385 |
10 | 101562543113 |
11 | 3a088453949 |
12 | 1782510ba35 |
13 | 976745c375 |
14 | 4cb67a4853 |
15 | 29964da578 |
hex | 17a5996c09 |
101562543113 has 4 divisors (see below), whose sum is σ = 101604461568. Its totient is φ = 101520624660.
The previous prime is 101562543091. The next prime is 101562543157. The reversal of 101562543113 is 311345265101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 311345265101 = 13 ⋅23949635777.
It is a cyclic number.
It is not a de Polignac number, because 101562543113 - 210 = 101562542089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101562543113.
It is not an unprimeable number, because it can be changed into a prime (101562543013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20955593 + ... + 20960438.
It is an arithmetic number, because the mean of its divisors is an integer number (25401115392).
Almost surely, 2101562543113 is an apocalyptic number.
It is an amenable number.
101562543113 is a deficient number, since it is larger than the sum of its proper divisors (41918455).
101562543113 is an equidigital number, since it uses as much as digits as its factorization.
101562543113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41918454.
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 101562543113 in words is "one hundred one billion, five hundred sixty-two million, five hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •