Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110000001001010110011 |
3 | 1022210121021202000101212100 |
4 | 2103020213032001022303 |
5 | 2311124322304013021 |
6 | 33300533452031443 |
7 | 2062332164314464 |
oct | 223104716011263 |
9 | 38717252011770 |
10 | 10111011001011 |
11 | 3249068131158 |
12 | 11736b9162583 |
13 | 584605c4497b |
14 | 26d5386c4d6b |
15 | 128025b91626 |
hex | 932273812b3 |
10111011001011 has 48 divisors (see below), whose sum is σ = 15812078967360. Its totient is φ = 6206796288000.
The previous prime is 10111011001009. The next prime is 10111011001027. The reversal of 10111011001011 is 11010011011101.
It is not a de Polignac number, because 10111011001011 - 21 = 10111011001009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10111011000984 and 10111011001002.
It is not an unprimeable number, because it can be changed into a prime (10111011001211) 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 47 ways as a sum of consecutive naturals, for example, 475990 + ... + 4522011.
It is an arithmetic number, because the mean of its divisors is an integer number (329418311820).
Almost surely, 210111011001011 is an apocalyptic number.
10111011001011 is a deficient number, since it is larger than the sum of its proper divisors (5701067966349).
10111011001011 is a wasteful number, since it uses less digits than its factorization.
10111011001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4998396 (or 4998393 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111011001011 its reverse (11010011011101), we get a palindrome (21121022012112).
The spelling of 10111011001011 in words is "ten trillion, one hundred eleven billion, eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •