Base | Representation |
---|---|
bin | 100111010110100… |
… | …011110110011001 |
3 | 1201000022221000211 |
4 | 213112203312121 |
5 | 2323004203213 |
6 | 145302531121 |
7 | 22234552330 |
oct | 4726436631 |
9 | 1630287024 |
10 | 660225433 |
11 | 30975315a |
12 | 165136aa1 |
13 | a6a2434a |
14 | 63982d17 |
15 | 3ce6753d |
hex | 275a3d99 |
660225433 has 8 divisors (see below), whose sum is σ = 794256320. Its totient is φ = 536122800.
The previous prime is 660225353. The next prime is 660225443. The reversal of 660225433 is 334522066.
It is a happy number.
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 660225433 - 213 = 660217241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 660225395 and 660225404.
It is not an unprimeable number, because it can be changed into a prime (660225443) 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 7 ways as a sum of consecutive naturals, for example, 2481918 + ... + 2482183.
It is an arithmetic number, because the mean of its divisors is an integer number (99282040).
Almost surely, 2660225433 is an apocalyptic number.
It is an amenable number.
660225433 is a deficient number, since it is larger than the sum of its proper divisors (134030887).
660225433 is a wasteful number, since it uses less digits than its factorization.
660225433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4964127.
The product of its (nonzero) digits is 25920, while the sum is 31.
The square root of 660225433 is about 25694.8522665533. The cubic root of 660225433 is about 870.7578867313.
Adding to 660225433 its reverse (334522066), we get a palindrome (994747499).
The spelling of 660225433 in words is "six hundred sixty million, two hundred twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •