Base | Representation |
---|---|
bin | 10100001110000011101… |
… | …11011000001001000000 |
3 | 2110102020210010020022221 |
4 | 22013001313120021000 |
5 | 42340313004113034 |
6 | 1251054333340424 |
7 | 101123234503261 |
oct | 12070167301100 |
9 | 2412223106287 |
10 | 694742254144 |
11 | 248702988394 |
12 | b278b937714 |
13 | 5068b0b6113 |
14 | 258a8d0c968 |
15 | 131126dbbb4 |
hex | a1c1dd8240 |
694742254144 has 63 divisors (see below), whose sum is σ = 1412018668083. Its totient is φ = 339152698752.
The previous prime is 694742254139. The next prime is 694742254163. The reversal of 694742254144 is 441452247496.
It is a happy number.
The square root of 694742254144 is 833512.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 694742254091 and 694742254100.
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, 286726917 + ... + 286729339.
Almost surely, 2694742254144 is an apocalyptic number.
694742254144 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
694742254144 is the 833512-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 694742254144
694742254144 is an abundant number, since it is smaller than the sum of its proper divisors (717276413939).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
694742254144 is an frugal number, since it uses more digits than its factorization.
694742254144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4944 (or 2468 counting only the distinct ones).
The product of its digits is 7741440, while the sum is 52.
The spelling of 694742254144 in words is "six hundred ninety-four billion, seven hundred forty-two million, two hundred fifty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •