Base | Representation |
---|---|
bin | 1110100110100010… |
… | …1101000100000000 |
3 | 101010011201112010221 |
4 | 3221220231010000 |
5 | 31011424333124 |
6 | 1444542032424 |
7 | 166064265400 |
oct | 35150550400 |
9 | 11104645127 |
10 | 3919761664 |
11 | 173166aa55 |
12 | 914878714 |
13 | 4a6109a00 |
14 | 292828800 |
15 | 17e1c5ce4 |
hex | e9a2d100 |
3919761664 has 243 divisors, whose sum is σ = 10090146213. Its totient is φ = 1514612736.
The previous prime is 3919761653. The next prime is 3919761679. The reversal of 3919761664 is 4661679193.
The square root of 3919761664 is 62608.
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., 579846400 + 3339915264 = 24080^2 + 57792^2 .
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 91157227 + ... + 91157269.
Almost surely, 23919761664 is an apocalyptic number.
3919761664 is the 62608-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3919761664
3919761664 is an abundant number, since it is smaller than the sum of its proper divisors (6170384549).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3919761664 is an equidigital number, since it uses as much as digits as its factorization.
3919761664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142 (or 65 counting only the distinct ones).
The product of its digits is 1469664, while the sum is 52.
The cubic root of 3919761664 is about 1576.7150765669.
The spelling of 3919761664 in words is "three billion, nine hundred nineteen million, seven hundred sixty-one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •