Base | Representation |
---|---|
bin | 111010100010111… |
… | …0011110100100000 |
3 | 12001220110202201212 |
4 | 1311011303310200 |
5 | 13010400112443 |
6 | 522533045252 |
7 | 66452416415 |
oct | 16505636440 |
9 | 5056422655 |
10 | 1964457248 |
11 | 918980896 |
12 | 469a86828 |
13 | 253cb1550 |
14 | 148c8610c |
15 | b76e1618 |
hex | 75173d20 |
1964457248 has 48 divisors (see below), whose sum is σ = 4195550520. Its totient is φ = 900028416.
The previous prime is 1964457241. The next prime is 1964457263. The reversal of 1964457248 is 8427544691.
It can be written as a sum of positive squares in 4 ways, for example, as 1526308624 + 438148624 = 39068^2 + 20932^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1964457196 and 1964457205.
It is not an unprimeable number, because it can be changed into a prime (1964457241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39758 + ... + 74226.
Almost surely, 21964457248 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 1964457248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2097775260).
1964457248 is an abundant number, since it is smaller than the sum of its proper divisors (2231093272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1964457248 is a wasteful number, since it uses less digits than its factorization.
1964457248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34629 (or 34621 counting only the distinct ones).
The product of its digits is 1935360, while the sum is 50.
The square root of 1964457248 is about 44322.1981404352. The cubic root of 1964457248 is about 1252.4128856295.
The spelling of 1964457248 in words is "one billion, nine hundred sixty-four million, four hundred fifty-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •