Base | Representation |
---|---|
bin | 10100000110011000101… |
… | …00101010001000000000 |
3 | 2110000121200111222020012 |
4 | 22003030110222020000 |
5 | 42303343410003343 |
6 | 1245133454004052 |
7 | 100616163250034 |
oct | 12031424521000 |
9 | 2400550458205 |
10 | 690622734848 |
11 | 246989590592 |
12 | b1a201a6628 |
13 | 501827a8537 |
14 | 255d7b661c4 |
15 | 12e70c08718 |
hex | a0cc52a200 |
690622734848 has 90 divisors (see below), whose sum is σ = 1457098963749. Its totient is φ = 326967846912.
The previous prime is 690622734833. The next prime is 690622734917. The reversal of 690622734848 is 848437226096.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 667240655104 + 23382079744 = 816848^2 + 152912^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=587632.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 357279290 + ... + 357281222.
Almost surely, 2690622734848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 690622734848
690622734848 is an abundant number, since it is smaller than the sum of its proper divisors (766476228901).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690622734848 is an frugal number, since it uses more digits than its factorization.
690622734848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3922 (or 1954 counting only the distinct ones).
The product of its (nonzero) digits is 27869184, while the sum is 59.
The spelling of 690622734848 in words is "six hundred ninety billion, six hundred twenty-two million, seven hundred thirty-four thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •