Base | Representation |
---|---|
bin | 111011101000101… |
… | …0000000101001110 |
3 | 12011110020220002100 |
4 | 1313101100011032 |
5 | 13044224323042 |
6 | 530320335530 |
7 | 100405212243 |
oct | 16721200516 |
9 | 5143226070 |
10 | 2001011022 |
11 | 93757821a |
12 | 47a1745a6 |
13 | 25b73c5ba |
14 | 14da7d5ca |
15 | baa1224c |
hex | 7745014e |
2001011022 has 24 divisors (see below), whose sum is σ = 4336346664. Its totient is φ = 666877104.
The previous prime is 2001011003. The next prime is 2001011029. The reversal of 2001011022 is 2201101002.
It is a super-2 number, since 2×20010110222 = 8008090220330968968, which 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 = 2001010995 and 2001011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001011029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 178948 + ... + 189800.
It is an arithmetic number, because the mean of its divisors is an integer number (180681111).
Almost surely, 22001011022 is an apocalyptic number.
2001011022 is an abundant number, since it is smaller than the sum of its proper divisors (2335335642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001011022 is a wasteful number, since it uses less digits than its factorization.
2001011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21104 (or 21101 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2001011022 is about 44732.6616914308. The cubic root of 2001011022 is about 1260.1333154480.
Adding to 2001011022 its reverse (2201101002), we get a palindrome (4202112024).
The spelling of 2001011022 in words is "two billion, one million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •