Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …011000001001001101000 |
3 | 21002102000202121110112112 |
4 | 131020230123001021220 |
5 | 230301001202240130 |
6 | 4131444211301452 |
7 | 264440245351664 |
oct | 35105433011150 |
9 | 7072022543475 |
10 | 2002200040040 |
11 | 7021457a84a2 |
12 | 2840588aa888 |
13 | 116a642ab005 |
14 | 6cc9ab3b8a4 |
15 | 37136206495 |
hex | 1d22c6c1268 |
2002200040040 has 32 divisors (see below), whose sum is σ = 4505006484000. Its totient is φ = 800869990464.
The previous prime is 2002200040037. The next prime is 2002200040051. The reversal of 2002200040040 is 400400022002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2002200039997 and 2002200040024.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3492851 + ... + 4025469.
It is an arithmetic number, because the mean of its divisors is an integer number (140781452625).
Almost surely, 22002200040040 is an apocalyptic number.
2002200040040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002200040040 is an abundant number, since it is smaller than the sum of its proper divisors (2502806443960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002200040040 is a wasteful number, since it uses less digits than its factorization.
2002200040040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626609 (or 626605 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 14.
Adding to 2002200040040 its reverse (400400022002), we get a palindrome (2402600062042).
The spelling of 2002200040040 in words is "two trillion, two billion, two hundred million, forty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •