Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01001010011010010011 |
3 | 10120122121000201102222000 |
4 | 32231210321022122103 |
5 | 113031022031133021 |
6 | 2052241313245043 |
7 | 133020525246444 |
oct | 16554471123223 |
9 | 3518530642860 |
10 | 1011010021011 |
11 | 35a848888711 |
12 | 143b35263783 |
13 | 744512c1483 |
14 | 36d0c7a52cb |
15 | 1b473134b26 |
hex | eb64e4a693 |
1011010021011 has 16 divisors (see below), whose sum is σ = 1497816652800. Its totient is φ = 673995867624.
The previous prime is 1011010020991. The next prime is 1011010021027. The reversal of 1011010021011 is 1101200101101.
It is not a de Polignac number, because 1011010021011 - 26 = 1011010020947 is a prime.
It is a super-2 number, since 2×10110100210112 (a number of 25 digits) contains 22 as substring.
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 = 1011010020984 and 1011010021002.
It is not an unprimeable number, because it can be changed into a prime (1011010021061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1642210 + ... + 2172296.
It is an arithmetic number, because the mean of its divisors is an integer number (93613540800).
Almost surely, 21011010021011 is an apocalyptic number.
1011010021011 is a deficient number, since it is larger than the sum of its proper divisors (486806631789).
1011010021011 is an equidigital number, since it uses as much as digits as its factorization.
1011010021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600735 (or 600729 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011010021011 its reverse (1101200101101), we get a palindrome (2112210122112).
The spelling of 1011010021011 in words is "one trillion, eleven billion, ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •