Base | Representation |
---|---|
bin | 100111100010100… |
… | …011100110010101 |
3 | 1201020020200202012 |
4 | 213202203212111 |
5 | 2324310321013 |
6 | 145454154005 |
7 | 22303360466 |
oct | 4742434625 |
9 | 1636220665 |
10 | 663370133 |
11 | 310500888 |
12 | 1661b2905 |
13 | a758580a |
14 | 64160d6d |
15 | 3d3891a8 |
hex | 278a3995 |
663370133 has 8 divisors (see below), whose sum is σ = 675662400. Its totient is φ = 651185568.
The previous prime is 663370109. The next prime is 663370139. The reversal of 663370133 is 331073366.
663370133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 663370133 - 28 = 663369877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 663370133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (663370139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14441 + ... + 39182.
It is an arithmetic number, because the mean of its divisors is an integer number (84457800).
Almost surely, 2663370133 is an apocalyptic number.
It is an amenable number.
663370133 is a deficient number, since it is larger than the sum of its proper divisors (12292267).
663370133 is a wasteful number, since it uses less digits than its factorization.
663370133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53851.
The product of its (nonzero) digits is 20412, while the sum is 32.
The square root of 663370133 is about 25755.9727636135. The cubic root of 663370133 is about 872.1381911596.
The spelling of 663370133 in words is "six hundred sixty-three million, three hundred seventy thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •