Base | Representation |
---|---|
bin | 100000010011101001000… |
… | …100001011010100011010 |
3 | 21212020111111212121012000 |
4 | 200103221010023110122 |
5 | 242333243001423002 |
6 | 4415523405101430 |
7 | 316253322530526 |
oct | 40235104132432 |
9 | 7766444777160 |
10 | 2220113311002 |
11 | 7865aa0a4264 |
12 | 2ba333557876 |
13 | 1314818825b2 |
14 | 7964dd10d86 |
15 | 3cb3c10161c |
hex | 204e910b51a |
2220113311002 has 32 divisors (see below), whose sum is σ = 4934318256000. Its totient is φ = 739927802304.
The previous prime is 2220113310979. The next prime is 2220113311007. The reversal of 2220113311002 is 2001133110222.
2220113311002 is a `hidden beast` number, since 2 + 220 + 11 + 331 + 100 + 2 = 666.
It is a super-2 number, since 2×22201133110022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2220113311007) 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, 2687502 + ... + 3415097.
It is an arithmetic number, because the mean of its divisors is an integer number (154197445500).
Almost surely, 22220113311002 is an apocalyptic number.
2220113311002 is an abundant number, since it is smaller than the sum of its proper divisors (2714204944998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2220113311002 is a wasteful number, since it uses less digits than its factorization.
2220113311002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6109347 (or 6109341 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2220113311002 its reverse (2001133110222), we get a palindrome (4221246421224).
The spelling of 2220113311002 in words is "two trillion, two hundred twenty billion, one hundred thirteen million, three hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •