Base | Representation |
---|---|
bin | 10100000011101011110… |
… | …11001100110001100010 |
3 | 2102212212200000000021202 |
4 | 22001311323030301202 |
5 | 42242411321023300 |
6 | 1244333553521202 |
7 | 100535232501401 |
oct | 12016573146142 |
9 | 2385780000252 |
10 | 689173220450 |
11 | 246305352a00 |
12 | b1696873202 |
13 | 4ccb13b1700 |
14 | 254db445638 |
15 | 12dd8832ad5 |
hex | a075eccc62 |
689173220450 has 162 divisors, whose sum is σ = 1527570621801. Its totient is φ = 231049104000.
The previous prime is 689173220443. The next prime is 689173220501. The reversal of 689173220450 is 54022371986.
It can be written as a sum of positive squares in 14 ways, for example, as 332655558169 + 356517662281 = 576763^2 + 597091^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=587015.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 689173220395 and 689173220404.
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 80 ways as a sum of consecutive naturals, for example, 839431040 + ... + 839431860.
It is a 1-persistent number, because it is pandigital, but 2⋅689173220450 = 1378346440900 is not.
Almost surely, 2689173220450 is an apocalyptic number.
689173220450 is an abundant number, since it is smaller than the sum of its proper divisors (838397401351).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
689173220450 is a wasteful number, since it uses less digits than its factorization.
689173220450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1702 (or 852 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 689173220450 in words is "six hundred eighty-nine billion, one hundred seventy-three million, two hundred twenty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •