Base | Representation |
---|---|
bin | 111010101010101… |
… | …0011100100000000 |
3 | 12002012010010222211 |
4 | 1311111103210000 |
5 | 13012420110144 |
6 | 523200111504 |
7 | 66532065454 |
oct | 16525234400 |
9 | 5065103884 |
10 | 1968519424 |
11 | 9201a5863 |
12 | 46b305594 |
13 | 254aa44c1 |
14 | 149622664 |
15 | b7c45034 |
hex | 75553900 |
1968519424 has 81 divisors (see below), whose sum is σ = 4083930907. Its totient is φ = 946990592.
The previous prime is 1968519409. The next prime is 1968519433. The reversal of 1968519424 is 4249158691.
The square root of 1968519424 is 44368.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
Its product of digits (622080) is a multiple of the sum of its prime divisors (108).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 33364707 + ... + 33364765.
Almost surely, 21968519424 is an apocalyptic number.
1968519424 is the 44368-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1968519424
1968519424 is an abundant number, since it is smaller than the sum of its proper divisors (2115411483).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1968519424 is an frugal number, since it uses more digits than its factorization.
1968519424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228 (or 108 counting only the distinct ones).
The product of its digits is 622080, while the sum is 49.
The cubic root of 1968519424 is about 1253.2755528918.
Multiplying 1968519424 by its sum of digits (49), we get a square (96457451776 = 3105762).
The spelling of 1968519424 in words is "one billion, nine hundred sixty-eight million, five hundred nineteen thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •