Base | Representation |
---|---|
bin | 1101110101101001… |
… | …0011000110010000 |
3 | 100120212210012210000 |
4 | 3131122103012100 |
5 | 30101423034304 |
6 | 1412334010000 |
7 | 161024035521 |
oct | 33532230620 |
9 | 10525705700 |
10 | 3714658704 |
11 | 1636912079 |
12 | 878046900 |
13 | 472786b03 |
14 | 2734b8848 |
15 | 16b1ae939 |
hex | dd693190 |
3714658704 has 75 divisors (see below), whose sum is σ = 10757654193. Its totient is φ = 1237488192.
The previous prime is 3714658681. The next prime is 3714658709. The reversal of 3714658704 is 4078564173.
The square root of 3714658704 is 60948.
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., 1415264400 + 2299394304 = 37620^2 + 47952^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 3714658704.
It is not an unprimeable number, because it can be changed into a prime (3714658709) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 2193282 + ... + 2194974.
Almost surely, 23714658704 is an apocalyptic number.
3714658704 is the 60948-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3714658704
3714658704 is an abundant number, since it is smaller than the sum of its proper divisors (7042995489).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3714658704 is an frugal number, since it uses more digits than its factorization.
3714658704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3406 (or 1698 counting only the distinct ones).
The product of its (nonzero) digits is 564480, while the sum is 45.
The cubic root of 3714658704 is about 1548.7202345234.
The spelling of 3714658704 in words is "three billion, seven hundred fourteen million, six hundred fifty-eight thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •