Base | Representation |
---|---|
bin | 111010100011011… |
… | …1110101110010000 |
3 | 12001221001100120211 |
4 | 1311012332232100 |
5 | 13010434422143 |
6 | 522543413504 |
7 | 66455135032 |
oct | 16506765620 |
9 | 5057040524 |
10 | 1964764048 |
11 | 919070345 |
12 | 469bb4294 |
13 | 25408b0a0 |
14 | 148d25c52 |
15 | b775249d |
hex | 751beb90 |
1964764048 has 80 divisors (see below), whose sum is σ = 4208480640. Its totient is φ = 883049472.
The previous prime is 1964764019. The next prime is 1964764051. The reversal of 1964764048 is 8404674691.
It is a junction number, because it is equal to n+sod(n) for n = 1964763992 and 1964764010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1259493 + ... + 1261051.
It is an arithmetic number, because the mean of its divisors is an integer number (52606008).
Almost surely, 21964764048 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 1964764048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2104240320).
1964764048 is an abundant number, since it is smaller than the sum of its proper divisors (2243716592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1964764048 is a wasteful number, since it uses less digits than its factorization.
1964764048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1736 (or 1730 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 49.
The square root of 1964764048 is about 44325.6590249936. The cubic root of 1964764048 is about 1252.4780809521.
The spelling of 1964764048 in words is "one billion, nine hundred sixty-four million, seven hundred sixty-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.999 sec. • engine limits •