Base | Representation |
---|---|
bin | 11110000111000001011… |
… | …000010111100110101000 |
3 | 21022210202210012121122001 |
4 | 132013001120113212220 |
5 | 232400031124111300 |
6 | 4222313044540344 |
7 | 302326545631132 |
oct | 36070130274650 |
9 | 7283683177561 |
10 | 2069123660200 |
11 | 728568400893 |
12 | 2950153b16b4 |
13 | 12016b27a75c |
14 | 72208d48052 |
15 | 38c516d716a |
hex | 1e1c16179a8 |
2069123660200 has 48 divisors (see below), whose sum is σ = 4811345491680. Its totient is φ = 827540564160.
The previous prime is 2069123660129. The next prime is 2069123660243. The reversal of 2069123660200 is 20663219602.
It is a self number, because there is not a number n which added to its sum of digits gives 2069123660200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 851797 + ... + 2205403.
It is an arithmetic number, because the mean of its divisors is an integer number (100236364410).
Almost surely, 22069123660200 is an apocalyptic number.
2069123660200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2069123660200 is an abundant number, since it is smaller than the sum of its proper divisors (2742221831480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2069123660200 is a wasteful number, since it uses less digits than its factorization.
2069123660200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1361266 (or 1361257 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 37.
Adding to 2069123660200 its reverse (20663219602), we get a palindrome (2089786879802).
The spelling of 2069123660200 in words is "two trillion, sixty-nine billion, one hundred twenty-three million, six hundred sixty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •