Base | Representation |
---|---|
bin | 110011100110000… |
… | …0110100001000000 |
3 | 11110122121101011001 |
4 | 1213030012201000 |
5 | 12021143210124 |
6 | 443442101344 |
7 | 60621114100 |
oct | 14714064100 |
9 | 4418541131 |
10 | 1731225664 |
11 | 809260513 |
12 | 40394a854 |
13 | 2178903ac |
14 | 125cd3200 |
15 | a1ec0b44 |
hex | 67306840 |
1731225664 has 63 divisors (see below), whose sum is σ = 4001668527. Its totient is φ = 740955264.
The previous prime is 1731225647. The next prime is 1731225677. The reversal of 1731225664 is 4665221371.
The square root of 1731225664 is 41608.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
Its product of digits (60480) is a multiple of the sum of its prime factors (1512).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2329677 + ... + 2330419.
Almost surely, 21731225664 is an apocalyptic number.
1731225664 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1731225664 is the 41608-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1731225664
1731225664 is an abundant number, since it is smaller than the sum of its proper divisors (2270442863).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1731225664 is an frugal number, since it uses more digits than its factorization.
1731225664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1512 (or 752 counting only the distinct ones).
The product of its digits is 60480, while the sum is 37.
The cubic root of 1731225664 is about 1200.7462173517.
The spelling of 1731225664 in words is "one billion, seven hundred thirty-one million, two hundred twenty-five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •