Base | Representation |
---|---|
bin | 101001010011100… |
… | …110011100000000 |
3 | 1210022000020211000 |
4 | 221103212130000 |
5 | 2404402112112 |
6 | 152433252000 |
7 | 23113302630 |
oct | 5123463400 |
9 | 1708006730 |
10 | 693004032 |
11 | 326201206 |
12 | 174104000 |
13 | b075cc76 |
14 | 680766c0 |
15 | 40c8e7dc |
hex | 294e6700 |
693004032 has 144 divisors (see below), whose sum is σ = 2342260480. Its totient is φ = 197987328.
The previous prime is 693003989. The next prime is 693004033. The reversal of 693004032 is 230400396.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 693003987 and 693004005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (693004033) 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, 41223 + ... + 55545.
Almost surely, 2693004032 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 693004032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1171130240).
693004032 is an abundant number, since it is smaller than the sum of its proper divisors (1649256448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
693004032 is a wasteful number, since it uses less digits than its factorization.
693004032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14355 (or 14335 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 693004032 is about 26324.9697435724. The cubic root of 693004032 is about 884.9361171929.
The spelling of 693004032 in words is "six hundred ninety-three million, four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •