Base | Representation |
---|---|
bin | 101001001001000… |
… | …111001111011000 |
3 | 1210002211120120220 |
4 | 221021013033120 |
5 | 2403201123213 |
6 | 152254320040 |
7 | 23051032455 |
oct | 5111071730 |
9 | 1702746526 |
10 | 690254808 |
11 | 3246a3721 |
12 | 1731b9020 |
13 | b00097c9 |
14 | 6795c82c |
15 | 408e9e23 |
hex | 292473d8 |
690254808 has 64 divisors (see below), whose sum is σ = 1847772000. Its totient is φ = 214106112.
The previous prime is 690254801. The next prime is 690254843. The reversal of 690254808 is 808452096.
It is a self number, because there is not a number n which added to its sum of digits gives 690254808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (690254801) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26808 + ... + 45816.
Almost surely, 2690254808 is an apocalyptic number.
690254808 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 690254808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (923886000).
690254808 is an abundant number, since it is smaller than the sum of its proper divisors (1157517192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690254808 is a wasteful number, since it uses less digits than its factorization.
690254808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19124 (or 19120 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 42.
The square root of 690254808 is about 26272.7008128209. The cubic root of 690254808 is about 883.7643530149.
The spelling of 690254808 in words is "six hundred ninety million, two hundred fifty-four thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •