Base | Representation |
---|---|
bin | 11101001000100110011… |
… | …101110001101110110110 |
3 | 21002101202210112222121101 |
4 | 131020212131301232312 |
5 | 230300300111200042 |
6 | 4131430241240314 |
7 | 264434623026451 |
oct | 35104635615666 |
9 | 7071683488541 |
10 | 2002100100022 |
11 | 7020a4348040 |
12 | 28402b33309a |
13 | 116a496888c9 |
14 | 6cc8b764498 |
15 | 3712c5646b7 |
hex | 1d226771bb6 |
2002100100022 has 8 divisors (see below), whose sum is σ = 3276163800072. Its totient is φ = 910045500000.
The previous prime is 2002100099971. The next prime is 2002100100041. The reversal of 2002100100022 is 2200010012002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2002100099981 and 2002100100008.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45502274979 + ... + 45502275022.
It is an arithmetic number, because the mean of its divisors is an integer number (409520475009).
Almost surely, 22002100100022 is an apocalyptic number.
2002100100022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2002100100022 is a deficient number, since it is larger than the sum of its proper divisors (1274063700050).
2002100100022 is a wasteful number, since it uses less digits than its factorization.
2002100100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91004550014.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 2002100100022 its reverse (2200010012002), we get a palindrome (4202110112024).
The spelling of 2002100100022 in words is "two trillion, two billion, one hundred million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •