Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001111000010010101011 |
3 | 111020122120001021100221012021 |
4 | 112331321310301320102223 |
5 | 101214431012011200021 |
6 | 554455451323325311 |
7 | 30163542514201561 |
oct | 2675716461702253 |
9 | 436576037327167 |
10 | 101011000100011 |
11 | 2a204585229011 |
12 | b3b4737680837 |
13 | 44493b13727b1 |
14 | 1ad2d5c153a31 |
15 | ba27dbae4c41 |
hex | 5bde74c784ab |
101011000100011 has 8 divisors (see below), whose sum is σ = 101054631191184. Its totient is φ = 100967378131200.
The previous prime is 101011000099979. The next prime is 101011000100039. The reversal of 101011000100011 is 110001000110101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101011000100011 - 25 = 101011000099979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101011000099967 and 101011000100003.
It is not an unprimeable number, because it can be changed into a prime (101011000100041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19916611 + ... + 24468211.
It is an arithmetic number, because the mean of its divisors is an integer number (12631828898898).
Almost surely, 2101011000100011 is an apocalyptic number.
101011000100011 is a deficient number, since it is larger than the sum of its proper divisors (43631091173).
101011000100011 is an equidigital number, since it uses as much as digits as its factorization.
101011000100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4561181.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101011000100011 its reverse (110001000110101), we get a palindrome (211012000210112).
The spelling of 101011000100011 in words is "one hundred one trillion, eleven billion, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •