Base | Representation |
---|---|
bin | 1100001100010101000… |
… | …1011001011010011010 |
3 | 202000200012012010010220 |
4 | 3003011101121122122 |
5 | 11412442313233143 |
6 | 240121152220510 |
7 | 21063546330540 |
oct | 3030521313232 |
9 | 660605163126 |
10 | 209468102298 |
11 | 80920312634 |
12 | 3471a53a736 |
13 | 169a2a66880 |
14 | a1d1747d90 |
15 | 56ae7b7d83 |
hex | 30c545969a |
209468102298 has 256 divisors, whose sum is σ = 546979184640. Its totient is φ = 51997075200.
The previous prime is 209468102293. The next prime is 209468102341. The reversal of 209468102298 is 892201864902.
It is a self number, because there is not a number n which added to its sum of digits gives 209468102298.
It is not an unprimeable number, because it can be changed into a prime (209468102293) 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 127 ways as a sum of consecutive naturals, for example, 142397703 + ... + 142399173.
It is an arithmetic number, because the mean of its divisors is an integer number (2136637440).
Almost surely, 2209468102298 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 209468102298, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (273489592320).
209468102298 is an abundant number, since it is smaller than the sum of its proper divisors (337511082342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
209468102298 is a wasteful number, since it uses less digits than its factorization.
209468102298 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1753.
The product of its (nonzero) digits is 995328, while the sum is 51.
The spelling of 209468102298 in words is "two hundred nine billion, four hundred sixty-eight million, one hundred two thousand, two hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •