Base | Representation |
---|---|
bin | 101000010010100… |
… | …100011011011001 |
3 | 1202002221010220202 |
4 | 220102210123121 |
5 | 2341021101231 |
6 | 151024031545 |
7 | 22515351326 |
oct | 5022443331 |
9 | 1662833822 |
10 | 675956441 |
11 | 317618096 |
12 | 16a4625b5 |
13 | aa071634 |
14 | 65ab9b4d |
15 | 3e5235cb |
hex | 284a46d9 |
675956441 has 4 divisors (see below), whose sum is σ = 694225572. Its totient is φ = 657687312.
The previous prime is 675956429. The next prime is 675956443. The reversal of 675956441 is 144659576.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 448550041 + 227406400 = 21179^2 + 15080^2 .
It is a cyclic number.
It is not a de Polignac number, because 675956441 - 26 = 675956377 is a prime.
It is a super-2 number, since 2×6759564412 = 913834220258772962, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (675956443) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 9134510 + ... + 9134583.
It is an arithmetic number, because the mean of its divisors is an integer number (173556393).
Almost surely, 2675956441 is an apocalyptic number.
It is an amenable number.
675956441 is a deficient number, since it is larger than the sum of its proper divisors (18269131).
675956441 is a wasteful number, since it uses less digits than its factorization.
675956441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18269130.
The product of its digits is 907200, while the sum is 47.
The square root of 675956441 is about 25999.1623134285. The cubic root of 675956441 is about 877.6194445134.
The spelling of 675956441 in words is "six hundred seventy-five million, nine hundred fifty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •