Base | Representation |
---|---|
bin | 100110001110001… |
… | …110101000000101 |
3 | 1122200122121000110 |
4 | 212032032220011 |
5 | 2303130423013 |
6 | 143344303233 |
7 | 21614440506 |
oct | 4616165005 |
9 | 1580577013 |
10 | 641264133 |
11 | 2a9a82264 |
12 | 15a911b19 |
13 | a2b15943 |
14 | 61248bad |
15 | 3b46e2c3 |
hex | 2638ea05 |
641264133 has 8 divisors (see below), whose sum is σ = 858041248. Its totient is φ = 425998224.
The previous prime is 641264111. The next prime is 641264189. The reversal of 641264133 is 331462146.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 641264133 - 25 = 641264101 is a prime.
It is a super-2 number, since 2×6412641332 = 822439376544483378, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 641264133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641264033) 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 7 ways as a sum of consecutive naturals, for example, 376810 + ... + 378507.
It is an arithmetic number, because the mean of its divisors is an integer number (107255156).
Almost surely, 2641264133 is an apocalyptic number.
It is an amenable number.
641264133 is a deficient number, since it is larger than the sum of its proper divisors (216777115).
641264133 is a wasteful number, since it uses less digits than its factorization.
641264133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755603.
The product of its digits is 10368, while the sum is 30.
The square root of 641264133 is about 25323.1935782199. The cubic root of 641264133 is about 862.3408970125.
The spelling of 641264133 in words is "six hundred forty-one million, two hundred sixty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •