Base | Representation |
---|---|
bin | 10110111111101011011100… |
… | …100010111100110010010011 |
3 | 111021002012221122220010021211 |
4 | 112333223130202330302103 |
5 | 101223430341011213021 |
6 | 555031505303000551 |
7 | 30205422010121644 |
oct | 2677533442746223 |
9 | 437065848803254 |
10 | 101133000101011 |
11 | 2a2512a003051a |
12 | b414305139157 |
13 | 4457a54a047b8 |
14 | 1ad8c12d556cb |
15 | ba5a7c45d3e1 |
hex | 5bfadc8bcc93 |
101133000101011 has 4 divisors (see below), whose sum is σ = 101133659062800. Its totient is φ = 101132341139224.
The previous prime is 101133000100931. The next prime is 101133000101053. The reversal of 101133000101011 is 110101000331101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101133000101011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101133000100982 and 101133000101000.
It is not an unprimeable number, because it can be changed into a prime (101133000101071) 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, 329250631 + ... + 329557648.
It is an arithmetic number, because the mean of its divisors is an integer number (25283414765700).
Almost surely, 2101133000101011 is an apocalyptic number.
101133000101011 is a deficient number, since it is larger than the sum of its proper divisors (658961789).
101133000101011 is an equidigital number, since it uses as much as digits as its factorization.
101133000101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 658961788.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 101133000101011 its reverse (110101000331101), we get a palindrome (211234000432112).
The spelling of 101133000101011 in words is "one hundred one trillion, one hundred thirty-three billion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •