Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0100011100000010010011 |
3 | 1022210121020222111121212122 |
4 | 2103020212210130002103 |
5 | 2311124312011213021 |
6 | 33300532422244455 |
7 | 2062332002546165 |
oct | 223104644340223 |
9 | 38717228447778 |
10 | 10111000101011 |
11 | 3249061a66897 |
12 | 11736b558672b |
13 | 5846038c9574 |
14 | 26d537088935 |
15 | 128024c3bbab |
hex | 9322691c093 |
10111000101011 has 6 divisors (see below), whose sum is σ = 10447682727636. Its totient is φ = 9784838806500.
The previous prime is 10111000100987. The next prime is 10111000101061. The reversal of 10111000101011 is 11010100011101.
It is not a de Polignac number, because 10111000101011 - 26 = 10111000100947 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10111000101011.
It is not an unprimeable number, because it can be changed into a prime (10111000101061) 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 5 ways as a sum of consecutive naturals, for example, 5260665065 + ... + 5260666986.
It is an arithmetic number, because the mean of its divisors is an integer number (1741280454606).
Almost surely, 210111000101011 is an apocalyptic number.
10111000101011 is a deficient number, since it is larger than the sum of its proper divisors (336682626625).
10111000101011 is an equidigital number, since it uses as much as digits as its factorization.
10111000101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10521332113 (or 10521332082 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10111000101011 its reverse (11010100011101), we get a palindrome (21121100112112).
The spelling of 10111000101011 in words is "ten trillion, one hundred eleven billion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •