Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001100000101100100010011 |
3 | 111020222001210112101110222222 |
4 | 112333030232030011210103 |
5 | 101222410310041213021 |
6 | 555004411540451255 |
7 | 30203143332546635 |
oct | 2677145614054423 |
9 | 436861715343888 |
10 | 101100010101011 |
11 | 2a239301037209 |
12 | b409a389a9b2b |
13 | 44548c8049a3c |
14 | 1ad73a3788a55 |
15 | ba4c9b0b86ab |
hex | 5bf32e305913 |
101100010101011 has 4 divisors (see below), whose sum is σ = 101104187293752. Its totient is φ = 101095832908272.
The previous prime is 101100010100981. The next prime is 101100010101043. The reversal of 101100010101011 is 110101010001101.
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 101100010101011 - 238 = 100825132194067 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 101100010101011.
It is not an unprimeable number, because it can be changed into a prime (101100010101061) 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, 2088560066 + ... + 2088608471.
It is an arithmetic number, because the mean of its divisors is an integer number (25276046823438).
Almost surely, 2101100010101011 is an apocalyptic number.
101100010101011 is a deficient number, since it is larger than the sum of its proper divisors (4177192741).
101100010101011 is an equidigital number, since it uses as much as digits as its factorization.
101100010101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4177192740.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101100010101011 its reverse (110101010001101), we get a palindrome (211201020102112).
The spelling of 101100010101011 in words is "one hundred one trillion, one hundred billion, ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •