Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101011011100101101110011 |
3 | 111020121111221022201120210021 |
4 | 112331233223223130231303 |
5 | 101214241211130013021 |
6 | 554450450542544311 |
7 | 30163005610656034 |
oct | 2675575353345563 |
9 | 436544838646707 |
10 | 101000110001011 |
11 | 2a1aa9a70344a1 |
12 | b3b25b8598097 |
13 | 4448367147430 |
14 | 1ad2607ad0a8b |
15 | ba23a0a13c41 |
hex | 5bdbebadcb73 |
101000110001011 has 4 divisors (see below), whose sum is σ = 108769349231872. Its totient is φ = 93230870770152.
The previous prime is 101000110000987. The next prime is 101000110001023. The reversal of 101000110001011 is 110100011000101.
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 101000110001011 - 27 = 101000110000883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101000110000985 and 101000110001003.
It is not an unprimeable number, because it can be changed into a prime (101000110071011) 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, 3884619615411 + ... + 3884619615436.
It is an arithmetic number, because the mean of its divisors is an integer number (27192337307968).
Almost surely, 2101000110001011 is an apocalyptic number.
101000110001011 is a deficient number, since it is larger than the sum of its proper divisors (7769239230861).
101000110001011 is an equidigital number, since it uses as much as digits as its factorization.
101000110001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7769239230860.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101000110001011 its reverse (110100011000101), we get a palindrome (211100121001112).
The spelling of 101000110001011 in words is "one hundred one trillion, one hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •