Base | Representation |
---|---|
bin | 11101001000100001110… |
… | …10110000111000101011 |
3 | 10112200210012012201120001 |
4 | 32210100322300320223 |
5 | 112400032333020021 |
6 | 2043505212243431 |
7 | 132214663660225 |
oct | 16442072607053 |
9 | 3480705181501 |
10 | 1001011220011 |
11 | 356587812510 |
12 | 142004770577 |
13 | 7351993398a |
14 | 36640875415 |
15 | 1b08a412091 |
hex | e910eb0e2b |
1001011220011 has 16 divisors (see below), whose sum is σ = 1140988612608. Its totient is φ = 869300555200.
The previous prime is 1001011219921. The next prime is 1001011220039. The reversal of 1001011220011 is 1100221101001.
It is not a de Polignac number, because 1001011220011 - 27 = 1001011219883 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 1001011220011.
It is not an unprimeable number, because it can be changed into a prime (1001011220071) 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 15 ways as a sum of consecutive naturals, for example, 2407051 + ... + 2792116.
It is an arithmetic number, because the mean of its divisors is an integer number (71311788288).
Almost surely, 21001011220011 is an apocalyptic number.
1001011220011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1001011220011 is a deficient number, since it is larger than the sum of its proper divisors (139977392597).
1001011220011 is a wasteful number, since it uses less digits than its factorization.
1001011220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5199962.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1001011220011 its reverse (1100221101001), we get a palindrome (2101232321012).
The spelling of 1001011220011 in words is "one trillion, one billion, eleven million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •