Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …101001010111111000110011 |
3 | 111020222001202220021011010221 |
4 | 112333030231221113320303 |
5 | 101222410300224013021 |
6 | 555004411013433511 |
7 | 30203143162316215 |
oct | 2677145551277063 |
9 | 436861686234127 |
10 | 101100001001011 |
11 | 2a2392a6991251 |
12 | b409a3593b897 |
13 | 44548c61b1a1c |
14 | 1ad73a249a5b5 |
15 | ba4c9a3bc241 |
hex | 5bf32da57e33 |
101100001001011 has 16 divisors (see below), whose sum is σ = 104698929202560. Its totient is φ = 97557820456320.
The previous prime is 101100001000903. The next prime is 101100001001053. The reversal of 101100001001011 is 110100100001101.
It is a happy number.
It is not a de Polignac number, because 101100001001011 - 239 = 100550245187123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100001000985 and 101100001001003.
It is not an unprimeable number, because it can be changed into a prime (101100001001911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 387209496 + ... + 387470506.
It is an arithmetic number, because the mean of its divisors is an integer number (6543683075160).
Almost surely, 2101100001001011 is an apocalyptic number.
101100001001011 is a deficient number, since it is larger than the sum of its proper divisors (3598928201549).
101100001001011 is a wasteful number, since it uses less digits than its factorization.
101100001001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 369666.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101100001001011 its reverse (110100100001101), we get a palindrome (211200101002112).
The spelling of 101100001001011 in words is "one hundred one trillion, one hundred billion, one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •