Base | Representation |
---|---|
bin | 10100000100000111011… |
… | …11100010101100011011 |
3 | 2102220110211012221111212 |
4 | 22002003233202230123 |
5 | 42243400142424111 |
6 | 1244412554413335 |
7 | 100544046125306 |
oct | 12020357425433 |
9 | 2386424187455 |
10 | 689405045531 |
11 | 2464141a2584 |
12 | b174043124b |
13 | 5001a42c607 |
14 | 2552014db3d |
15 | 12dedd7698b |
hex | a083be2b1b |
689405045531 has 8 divisors (see below), whose sum is σ = 694460818800. Its totient is φ = 684350644320.
The previous prime is 689405045491. The next prime is 689405045561. The reversal of 689405045531 is 135540504986.
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 689405045531 - 218 = 689404783387 is a prime.
It is a super-2 number, since 2×6894050455312 (a number of 24 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 689405045531.
It is not an unprimeable number, because it can be changed into a prime (689405045561) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 676661 + ... + 1355241.
It is an arithmetic number, because the mean of its divisors is an integer number (86807602350).
Almost surely, 2689405045531 is an apocalyptic number.
689405045531 is a deficient number, since it is larger than the sum of its proper divisors (5055773269).
689405045531 is a wasteful number, since it uses less digits than its factorization.
689405045531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686029.
The product of its (nonzero) digits is 2592000, while the sum is 50.
The spelling of 689405045531 in words is "six hundred eighty-nine billion, four hundred five million, forty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •