Base | Representation |
---|---|
bin | 101111010100000111… |
… | …0001100011101001101 |
3 | 100201021010122002101011 |
4 | 1132220032030131031 |
5 | 3131042233304013 |
6 | 114402152445221 |
7 | 10224622230616 |
oct | 1365016143515 |
9 | 321233562334 |
10 | 101606541133 |
11 | 3a100275249 |
12 | 178379a9811 |
13 | 97735c58b6 |
14 | 4cbc578c0d |
15 | 299a2cbc3d |
hex | 17a838c74d |
101606541133 has 4 divisors (see below), whose sum is σ = 101638627200. Its totient is φ = 101574455068.
The previous prime is 101606541109. The next prime is 101606541139. The reversal of 101606541133 is 331145606101.
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.
It is a cyclic number.
It is not a de Polignac number, because 101606541133 - 225 = 101572986701 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101606541095 and 101606541104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101606541139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16038283 + ... + 16044616.
It is an arithmetic number, because the mean of its divisors is an integer number (25409656800).
Almost surely, 2101606541133 is an apocalyptic number.
It is an amenable number.
101606541133 is a deficient number, since it is larger than the sum of its proper divisors (32086067).
101606541133 is an equidigital number, since it uses as much as digits as its factorization.
101606541133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32086066.
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 101606541133 in words is "one hundred one billion, six hundred six million, five hundred forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •