Base | Representation |
---|---|
bin | 1110101001001100… |
… | …1011011110000000 |
3 | 101010221200012221020 |
4 | 3222103023132000 |
5 | 31022302140011 |
6 | 1450020425440 |
7 | 166261031640 |
oct | 35223133600 |
9 | 11127605836 |
10 | 3930896256 |
11 | 17379855a1 |
12 | 918548280 |
13 | 4a8507b21 |
14 | 2940c6520 |
15 | 180175006 |
hex | ea4cb780 |
3930896256 has 256 divisors, whose sum is σ = 12408422400. Its totient is φ = 1079285760.
The previous prime is 3930896251. The next prime is 3930896257. The reversal of 3930896256 is 6526980393.
It is a junction number, because it is equal to n+sod(n) for n = 3930896199 and 3930896208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3930896251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8206225 + ... + 8206703.
It is an arithmetic number, because the mean of its divisors is an integer number (48470400).
Almost surely, 23930896256 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3930896256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6204211200).
3930896256 is an abundant number, since it is smaller than the sum of its proper divisors (8477526144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3930896256 is a wasteful number, since it uses less digits than its factorization.
3930896256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617 (or 605 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 51.
The square root of 3930896256 is about 62696.8600170694. The cubic root of 3930896256 is about 1578.2066197885.
The spelling of 3930896256 in words is "three billion, nine hundred thirty million, eight hundred ninety-six thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •