Base | Representation |
---|---|
bin | 11101011001011101010… |
… | …01110000000000000011 |
3 | 10120120020121101010220221 |
4 | 32230232221300000003 |
5 | 113022141100323021 |
6 | 2052011124443511 |
7 | 132656135300200 |
oct | 16545651600003 |
9 | 3516217333827 |
10 | 1010100011011 |
11 | 35a421139733 |
12 | 143920549597 |
13 | 74337901810 |
14 | 36c639a0ca7 |
15 | 1b41d2cc241 |
hex | eb2ea70003 |
1010100011011 has 12 divisors (see below), whose sum is σ = 1265400014592. Its totient is φ = 799200008208.
The previous prime is 1010100010999. The next prime is 1010100011047. The reversal of 1010100011011 is 1101100010101.
It is a happy number.
It is not a de Polignac number, because 1010100011011 - 211 = 1010100008963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 1010100010985 and 1010100011003.
It is not an unprimeable number, because it can be changed into a prime (1010100011071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 792856515 + ... + 792857788.
It is an arithmetic number, because the mean of its divisors is an integer number (105450001216).
Almost surely, 21010100011011 is an apocalyptic number.
1010100011011 is a deficient number, since it is larger than the sum of its proper divisors (255300003581).
1010100011011 is a wasteful number, since it uses less digits than its factorization.
1010100011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1585714330 (or 1585714323 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1010100011011 its reverse (1101100010101), we get a palindrome (2111200021112).
The spelling of 1010100011011 in words is "one trillion, ten billion, one hundred million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •