Base | Representation |
---|---|
bin | 1010000001100100001001… |
… | …1101000101001000110010 |
3 | 1110000200201012102022220200 |
4 | 2200121002131011020302 |
5 | 2421041024224013020 |
6 | 35235234245220030 |
7 | 2215212313461366 |
oct | 240310235051062 |
9 | 43020635368820 |
10 | 11022001001010 |
11 | 356a44a24967a |
12 | 12a0179a01616 |
13 | 61c4a753684c |
14 | 2a16794d72a6 |
15 | 141a92e34590 |
hex | a0642745232 |
11022001001010 has 48 divisors (see below), whose sum is σ = 28674497621016. Its totient is φ = 2937426418944.
The previous prime is 11022001000981. The next prime is 11022001001029. The reversal of 11022001001010 is 1010010022011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 10150576884009 + 871424117001 = 3185997^2 + 933501^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11022001000983 and 11022001001001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36805209 + ... + 37103468.
Almost surely, 211022001001010 is an apocalyptic number.
11022001001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11022001001010 is an abundant number, since it is smaller than the sum of its proper divisors (17652496620006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022001001010 is a wasteful number, since it uses less digits than its factorization.
11022001001010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73910347 (or 73910344 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11022001001010 its reverse (1010010022011), we get a palindrome (12032011023021).
The spelling of 11022001001010 in words is "eleven trillion, twenty-two billion, one million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •