Base | Representation |
---|---|
bin | 1111010111100110… |
… | …1010010110100101 |
3 | 101122111220211011221 |
4 | 3311321222112211 |
5 | 31422114033410 |
6 | 1521212300341 |
7 | 204143312524 |
oct | 36571522645 |
9 | 11574824157 |
10 | 4125533605 |
11 | 1827835506 |
12 | 9717716b1 |
13 | 50993525b |
14 | 2b1cb04bb |
15 | 1922c04da |
hex | f5e6a5a5 |
4125533605 has 8 divisors (see below), whose sum is σ = 4983867000. Its totient is φ = 3278275776.
The previous prime is 4125533569. The next prime is 4125533651. The reversal of 4125533605 is 5063355214.
It can be written as a sum of positive squares in 4 ways, for example, as 761649604 + 3363884001 = 27598^2 + 57999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4125533605 - 225 = 4091979173 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2768070 + ... + 2769559.
It is an arithmetic number, because the mean of its divisors is an integer number (622983375).
Almost surely, 24125533605 is an apocalyptic number.
It is an amenable number.
4125533605 is a deficient number, since it is larger than the sum of its proper divisors (858333395).
4125533605 is a wasteful number, since it uses less digits than its factorization.
4125533605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5537783.
The product of its (nonzero) digits is 54000, while the sum is 34.
The square root of 4125533605 is about 64230.3168682827. The cubic root of 4125533605 is about 1603.8363158084.
Adding to 4125533605 its reverse (5063355214), we get a palindrome (9188888819).
The spelling of 4125533605 in words is "four billion, one hundred twenty-five million, five hundred thirty-three thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •