Base | Representation |
---|---|
bin | 1111111011011000… |
… | …0101011100010000 |
3 | 102000222021112010120 |
4 | 3332312011130100 |
5 | 32224022402203 |
6 | 1544132430240 |
7 | 210644631450 |
oct | 37666053420 |
9 | 12028245116 |
10 | 4275590928 |
11 | 18a4506824 |
12 | 9b3a78380 |
13 | 531a5427b |
14 | 2c7bb1d60 |
15 | 1a0561b53 |
hex | fed85710 |
4275590928 has 160 divisors (see below), whose sum is σ = 13071163392. Its totient is φ = 1178496000.
The previous prime is 4275590927. The next prime is 4275590951. The reversal of 4275590928 is 8290955724.
It is not an unprimeable number, because it can be changed into a prime (4275590927) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 6259675 + ... + 6260357.
Almost surely, 24275590928 is an apocalyptic number.
4275590928 is a gapful number since it is divisible by the number (48) 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 4275590928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6535581696).
4275590928 is an abundant number, since it is smaller than the sum of its proper divisors (8795572464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4275590928 is a wasteful number, since it uses less digits than its factorization.
4275590928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333 (or 1327 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 51.
The square root of 4275590928 is about 65388.0029363185. The cubic root of 4275590928 is about 1623.0505604892.
The spelling of 4275590928 in words is "four billion, two hundred seventy-five million, five hundred ninety thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •