Base | Representation |
---|---|
bin | 100000000001000001011… |
… | …000001101001010100101 |
3 | 21210022220011011021002101 |
4 | 200001001120031022211 |
5 | 242021321222314343 |
6 | 4402415441412101 |
7 | 314645012313046 |
oct | 40010130151245 |
9 | 7708804137071 |
10 | 2200120119973 |
11 | 77907a4a5996 |
12 | 2b649393a031 |
13 | 12c61671cc49 |
14 | 786b48bc8cd |
15 | 3c36bc7ce4d |
hex | 2004160d2a5 |
2200120119973 has 8 divisors (see below), whose sum is σ = 2208994890560. Its totient is φ = 2191262401440.
The previous prime is 2200120119949. The next prime is 2200120120027. The reversal of 2200120119973 is 3799110210022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2200120119973 - 221 = 2200118022821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200120119943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4004415 + ... + 4520572.
It is an arithmetic number, because the mean of its divisors is an integer number (276124361320).
Almost surely, 22200120119973 is an apocalyptic number.
It is an amenable number.
2200120119973 is a deficient number, since it is larger than the sum of its proper divisors (8874770587).
2200120119973 is an equidigital number, since it uses as much as digits as its factorization.
2200120119973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8526027.
The product of its (nonzero) digits is 13608, while the sum is 37.
Adding to 2200120119973 its reverse (3799110210022), we get a palindrome (5999230329995).
The spelling of 2200120119973 in words is "two trillion, two hundred billion, one hundred twenty million, one hundred nineteen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •