Base | Representation |
---|---|
bin | 10100011010111010101 |
3 | 1020222220000 |
4 | 2203113111 |
5 | 132403031 |
6 | 22201513 |
7 | 5454564 |
oct | 2432725 |
9 | 1228800 |
10 | 669141 |
11 | 417810 |
12 | 283299 |
13 | 1a5755 |
14 | 135bdb |
15 | d33e6 |
hex | a35d5 |
669141 has 20 divisors (see below), whose sum is σ = 1091904. Its totient is φ = 405000.
The previous prime is 669133. The next prime is 669167. The reversal of 669141 is 141966.
It is not a de Polignac number, because 669141 - 23 = 669133 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (669121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 516 + ... + 1266.
2669141 is an apocalyptic number.
It is an amenable number.
669141 is a deficient number, since it is larger than the sum of its proper divisors (422763).
669141 is a wasteful number, since it uses less digits than its factorization.
669141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774 (or 765 counting only the distinct ones).
The product of its digits is 1296, while the sum is 27.
The square root of 669141 is about 818.0103911320. The cubic root of 669141 is about 87.4659895032.
It can be divided in two parts, 66 and 9141, that multiplied together give a palindrome (603306).
The spelling of 669141 in words is "six hundred sixty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •