Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100010010100100011011 |
3 | 111020222011100112002001212021 |
4 | 112333031221030102210123 |
5 | 101222414322000310021 |
6 | 555005054101555311 |
7 | 30203210012622001 |
oct | 2677155114224433 |
9 | 436864315061767 |
10 | 101101000010011 |
11 | 2a239769898521 |
12 | b40a074415b37 |
13 | 4454a25162b01 |
14 | 1ad745902aa71 |
15 | ba4d07e54c41 |
hex | 5bf36931291b |
101101000010011 has 4 divisors (see below), whose sum is σ = 101382618394800. Its totient is φ = 100819381625224.
The previous prime is 101101000009969. The next prime is 101101000010027. The reversal of 101101000010011 is 110010000101101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101101000010011 - 219 = 101100999485723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101101000009976 and 101101000010003.
It is not an unprimeable number, because it can be changed into a prime (101101000010071) 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, 140809191856 + ... + 140809192573.
It is an arithmetic number, because the mean of its divisors is an integer number (25345654598700).
Almost surely, 2101101000010011 is an apocalyptic number.
101101000010011 is a deficient number, since it is larger than the sum of its proper divisors (281618384789).
101101000010011 is an equidigital number, since it uses as much as digits as its factorization.
101101000010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281618384788.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101101000010011 its reverse (110010000101101), we get a palindrome (211111000111112).
The spelling of 101101000010011 in words is "one hundred one trillion, one hundred one billion, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •