Base | Representation |
---|---|
bin | 11110100011011100011… |
… | …000111101101101100100 |
3 | 21102201112122001011200221 |
4 | 132203130120331231210 |
5 | 233400031220302241 |
6 | 4244321221414124 |
7 | 304460034615400 |
oct | 36433430755544 |
9 | 7381478034627 |
10 | 2099641572196 |
11 | 73a4a8a25863 |
12 | 29ab1186a344 |
13 | 122cc2a2984c |
14 | 738a208c100 |
15 | 3993aa165d1 |
hex | 1e8dc63db64 |
2099641572196 has 243 divisors, whose sum is σ = 4587344224281. Its totient is φ = 838387908288.
The previous prime is 2099641572151. The next prime is 2099641572289. The reversal of 2099641572196 is 6912751469902.
The square root of 2099641572196 is 1449014.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1101001109796 + 998640462400 = 1049286^2 + 999320^2 .
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 80 ways as a sum of consecutive naturals, for example, 25296886371 + ... + 25296886453.
Almost surely, 22099641572196 is an apocalyptic number.
2099641572196 is the 1449014-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2099641572196
2099641572196 is an abundant number, since it is smaller than the sum of its proper divisors (2487702652085).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2099641572196 is an equidigital number, since it uses as much as digits as its factorization.
2099641572196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328 (or 164 counting only the distinct ones).
The product of its (nonzero) digits is 14696640, while the sum is 61.
The spelling of 2099641572196 in words is "two trillion, ninety-nine billion, six hundred forty-one million, five hundred seventy-two thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •