Base | Representation |
---|---|
bin | 101010011111100… |
… | …0011100001000000 |
3 | 10200100220221022210 |
4 | 1110333003201000 |
5 | 10410002044431 |
6 | 353252102120 |
7 | 50222142561 |
oct | 12477034100 |
9 | 3610827283 |
10 | 1425815616 |
11 | 671921415 |
12 | 339604940 |
13 | 199519ca4 |
14 | d7512168 |
15 | 85293d46 |
hex | 54fc3840 |
1425815616 has 56 divisors (see below), whose sum is σ = 3789501184. Its totient is φ = 473126400.
The previous prime is 1425815591. The next prime is 1425815623. The reversal of 1425815616 is 6165185241.
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 7 ways as a sum of consecutive naturals, for example, 26166 + ... + 59466.
It is an arithmetic number, because the mean of its divisors is an integer number (67669664).
Almost surely, 21425815616 is an apocalyptic number.
1425815616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1425815616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1894750592).
1425815616 is an abundant number, since it is smaller than the sum of its proper divisors (2363685568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425815616 is a wasteful number, since it uses less digits than its factorization.
1425815616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33539 (or 33529 counting only the distinct ones).
The product of its digits is 57600, while the sum is 39.
The square root of 1425815616 is about 37759.9737288044. The cubic root of 1425815616 is about 1125.5232110489.
The spelling of 1425815616 in words is "one billion, four hundred twenty-five million, eight hundred fifteen thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •