Base | Representation |
---|---|
bin | 1100001011000010011… |
… | …0011101100101100001 |
3 | 201222210000121212210001 |
4 | 3002300212131211201 |
5 | 11411240023143011 |
6 | 240022523140001 |
7 | 21052135513531 |
oct | 3026046354541 |
9 | 658700555701 |
10 | 209121302881 |
11 | 80762584047 |
12 | 34642374601 |
13 | 16948c6140a |
14 | a19b6714c1 |
15 | 568e1127c1 |
hex | 30b099d961 |
209121302881 has 8 divisors (see below), whose sum is σ = 213708643200. Its totient is φ = 204539710608.
The previous prime is 209121302879. The next prime is 209121302939. The reversal of 209121302881 is 188203121902.
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 209121302881 - 21 = 209121302879 is a prime.
It is a super-2 number, since 2×2091213028812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 209121302881.
It is not an unprimeable number, because it can be changed into a prime (209121302801) by changing a digit.
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, 1363411 + ... + 1509016.
It is an arithmetic number, because the mean of its divisors is an integer number (26713580400).
Almost surely, 2209121302881 is an apocalyptic number.
It is an amenable number.
209121302881 is a deficient number, since it is larger than the sum of its proper divisors (4587340319).
209121302881 is a wasteful number, since it uses less digits than its factorization.
209121302881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2874023.
The product of its (nonzero) digits is 13824, while the sum is 37.
The spelling of 209121302881 in words is "two hundred nine billion, one hundred twenty-one million, three hundred two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •