Base | Representation |
---|---|
bin | 10100000101101111110… |
… | …10101110000001011010 |
3 | 2102222201211100002102000 |
4 | 22002313322232001122 |
5 | 42302143240000441 |
6 | 1245035504221430 |
7 | 100604535340212 |
oct | 12026772560132 |
9 | 2388654302360 |
10 | 690280390746 |
11 | 246823315381 |
12 | b194560a876 |
13 | 501298a2c6b |
14 | 255a44cd242 |
15 | 12e50b332b6 |
hex | a0b7eae05a |
690280390746 has 32 divisors (see below), whose sum is σ = 1600650184320. Its totient is φ = 220089399552.
The previous prime is 690280390729. The next prime is 690280390771. The reversal of 690280390746 is 647093082096.
It is a happy number.
690280390746 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 690280390692 and 690280390701.
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, 277889415 + ... + 277891898.
It is an arithmetic number, because the mean of its divisors is an integer number (50020318260).
Almost surely, 2690280390746 is an apocalyptic number.
690280390746 is an abundant number, since it is smaller than the sum of its proper divisors (910369793574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690280390746 is a wasteful number, since it uses less digits than its factorization.
690280390746 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 555781347 (or 555781341 counting only the distinct ones).
The product of its (nonzero) digits is 3919104, while the sum is 54.
The spelling of 690280390746 in words is "six hundred ninety billion, two hundred eighty million, three hundred ninety thousand, seven hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •