Base | Representation |
---|---|
bin | 11001010101100111010101 |
3 | 110111110021221 |
4 | 121111213111 |
5 | 3200022013 |
6 | 354210341 |
7 | 110312551 |
oct | 31254725 |
9 | 13443257 |
10 | 6642133 |
11 | 3827373 |
12 | 22839b1 |
13 | 14b7374 |
14 | c4c861 |
15 | 8b308d |
hex | 6559d5 |
6642133 has 4 divisors (see below), whose sum is σ = 6703180. Its totient is φ = 6581088.
The previous prime is 6642127. The next prime is 6642137. The reversal of 6642133 is 3312466.
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 2634129 + 4008004 = 1623^2 + 2002^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6642133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6642098 and 6642107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6642137) 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, 30360 + ... + 30577.
It is an arithmetic number, because the mean of its divisors is an integer number (1675795).
Almost surely, 26642133 is an apocalyptic number.
It is an amenable number.
6642133 is a deficient number, since it is larger than the sum of its proper divisors (61047).
6642133 is a wasteful number, since it uses less digits than its factorization.
6642133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61046.
The product of its digits is 2592, while the sum is 25.
The square root of 6642133 is about 2577.2335943798. The cubic root of 6642133 is about 187.9760513481.
Adding to 6642133 its reverse (3312466), we get a palindrome (9954599).
The spelling of 6642133 in words is "six million, six hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •