Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …11000011000100110011 |
3 | 10120122121210101021200200 |
4 | 32231211203003010303 |
5 | 113031032334013021 |
6 | 2052242344450243 |
7 | 133021020500220 |
oct | 16554543030463 |
9 | 3518553337620 |
10 | 1011021001011 |
11 | 35a853aa809a |
12 | 143b38a79983 |
13 | 74453667108 |
14 | 36d10022947 |
15 | 1b4740a3126 |
hex | eb658c3133 |
1011021001011 has 48 divisors (see below), whose sum is σ = 1674772709376. Its totient is φ = 575726159808.
The previous prime is 1011021000893. The next prime is 1011021001019. The reversal of 1011021001011 is 1101001201101.
1011021001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1011021001011 - 226 = 1010953892147 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 = 1011021000984 and 1011021001002.
It is not an unprimeable number, because it can be changed into a prime (1011021001019) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29251206 + ... + 29285748.
It is an arithmetic number, because the mean of its divisors is an integer number (34891098112).
Almost surely, 21011021001011 is an apocalyptic number.
1011021001011 is a deficient number, since it is larger than the sum of its proper divisors (663751708365).
1011021001011 is a wasteful number, since it uses less digits than its factorization.
1011021001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36152 (or 36149 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011021001011 its reverse (1101001201101), we get a palindrome (2112022202112).
The spelling of 1011021001011 in words is "one trillion, eleven billion, twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •