Base | Representation |
---|---|
bin | 1001000110000100111001… |
… | …1101000010101010010011 |
3 | 1022101222202012102101101112 |
4 | 2101201032131002222103 |
5 | 2302320000011213021 |
6 | 33133534151123535 |
7 | 2051322216244634 |
oct | 221411635025223 |
9 | 38358665371345 |
10 | 10000000101011 |
11 | 3205a813a29a8 |
12 | 11560979735ab |
13 | 576cc41924ab |
14 | 26800715788b |
15 | 1251c9e62d5b |
hex | 9184e742a93 |
10000000101011 has 4 divisors (see below), whose sum is σ = 10050251358000. Its totient is φ = 9949748844024.
The previous prime is 10000000100971. The next prime is 10000000101023. The reversal of 10000000101011 is 11010100000001.
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 10000000101011 - 26 = 10000000100947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000000100986 and 10000000101004.
It is not an unprimeable number, because it can be changed into a prime (10000000100011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25125628196 + ... + 25125628593.
It is an arithmetic number, because the mean of its divisors is an integer number (2512562839500).
Almost surely, 210000000101011 is an apocalyptic number.
10000000101011 is a deficient number, since it is larger than the sum of its proper divisors (50251256989).
10000000101011 is an equidigital number, since it uses as much as digits as its factorization.
10000000101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50251256988.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10000000101011 its reverse (11010100000001), we get a palindrome (21010100101012).
The spelling of 10000000101011 in words is "ten trillion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •