Base | Representation |
---|---|
bin | 1100001101011000001… |
… | …1110111100100001100 |
3 | 202001101211012020110222 |
4 | 3003112003313210030 |
5 | 11414031420042320 |
6 | 240205133250512 |
7 | 21103536420641 |
oct | 3032603674414 |
9 | 661354166428 |
10 | 209749768460 |
11 | 80a55304591 |
12 | 34798933a38 |
13 | 16a1921573b |
14 | a21ad07dc8 |
15 | 56c93a4825 |
hex | 30d60f790c |
209749768460 has 48 divisors (see below), whose sum is σ = 447137402880. Its totient is φ = 82640295360.
The previous prime is 209749768447. The next prime is 209749768549. The reversal of 209749768460 is 64867947902.
209749768460 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2097497684602 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 209749768393 and 209749768402.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56015 + ... + 650105.
It is an arithmetic number, because the mean of its divisors is an integer number (9315362560).
Almost surely, 2209749768460 is an apocalyptic number.
209749768460 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
209749768460 is an abundant number, since it is smaller than the sum of its proper divisors (237387634420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
209749768460 is a wasteful number, since it uses less digits than its factorization.
209749768460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 594366 (or 594364 counting only the distinct ones).
The product of its (nonzero) digits is 36578304, while the sum is 62.
The spelling of 209749768460 in words is "two hundred nine billion, seven hundred forty-nine million, seven hundred sixty-eight thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •