Base | Representation |
---|---|
bin | 1101101011010100… |
… | …1111100100000000 |
3 | 100110212100221220121 |
4 | 3122311033210000 |
5 | 30004333443324 |
6 | 1404150350024 |
7 | 156660206200 |
oct | 33265174400 |
9 | 10425327817 |
10 | 3671390464 |
11 | 1614449aa5 |
12 | 86565b314 |
13 | 4668177c1 |
14 | 26b854400 |
15 | 1674b45e4 |
hex | dad4f900 |
3671390464 has 81 divisors (see below), whose sum is σ = 8540706321. Its totient is φ = 1570544640.
The previous prime is 3671390449. The next prime is 3671390467. The reversal of 3671390464 is 4640931763.
The square root of 3671390464 is 60592.
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., 1458628864 + 2212761600 = 38192^2 + 47040^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 3671390464.
It is not an unprimeable number, because it can be changed into a prime (3671390467) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6786034 + ... + 6786574.
Almost surely, 23671390464 is an apocalyptic number.
3671390464 is the 60592-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3671390464
3671390464 is an abundant number, since it is smaller than the sum of its proper divisors (4869315857).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3671390464 is an frugal number, since it uses more digits than its factorization.
3671390464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112 (or 550 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 43.
The cubic root of 3671390464 is about 1542.6835853631.
The spelling of 3671390464 in words is "three billion, six hundred seventy-one million, three hundred ninety thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •