Base | Representation |
---|---|
bin | 10101101100111110111… |
… | …10000000011101100100 |
3 | 2122021210110010002010001 |
4 | 22312133132000131210 |
5 | 44204200411121024 |
6 | 1330323321311044 |
7 | 104606155044541 |
oct | 12663736003544 |
9 | 2567713102101 |
10 | 745704785764 |
11 | 268284a02714 |
12 | 100633035484 |
13 | 554203a4883 |
14 | 281413d5bc8 |
15 | 145e6811244 |
hex | ad9f780764 |
745704785764 has 27 divisors (see below), whose sum is σ = 1337715578073. Its totient is φ = 363723890400.
The previous prime is 745704785731. The next prime is 745704785843. The reversal of 745704785764 is 467587407547.
The square root of 745704785764 is 863542.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 35932235364 + 709772550400 = 189558^2 + 842480^2 .
It is a super-2 number, since 2×7457047857642 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 745704785696 and 745704785705.
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, 70805179 + ... + 70815709.
Almost surely, 2745704785764 is an apocalyptic number.
745704785764 is the 863542-nd square number.
It is an amenable number.
745704785764 is a deficient number, since it is larger than the sum of its proper divisors (592010792309).
745704785764 is an frugal number, since it uses more digits than its factorization.
745704785764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21148 (or 10574 counting only the distinct ones).
The product of its (nonzero) digits is 184396800, while the sum is 64.
Multiplying 745704785764 by its sum of digits (64), we get a square (47725106288896 = 69083362).
The spelling of 745704785764 in words is "seven hundred forty-five billion, seven hundred four million, seven hundred eighty-five thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •