Base | Representation |
---|---|
bin | 100110001110001… |
… | …111001000010001 |
3 | 1122200122200211202 |
4 | 212032033020101 |
5 | 2303131004233 |
6 | 143344320545 |
7 | 21614446511 |
oct | 4616171021 |
9 | 1580580752 |
10 | 641266193 |
11 | 2a9a83867 |
12 | 15a913155 |
13 | a2b16869 |
14 | 61249841 |
15 | 3b46ebe8 |
hex | 2638f211 |
641266193 has 4 divisors (see below), whose sum is σ = 644973108. Its totient is φ = 637559280.
The previous prime is 641266121. The next prime is 641266201. The reversal of 641266193 is 391662146.
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 307546369 + 333719824 = 17537^2 + 18268^2 .
It is a cyclic number.
It is not a de Polignac number, because 641266193 - 228 = 372830737 is a prime.
It is a super-2 number, since 2×6412661932 = 822444660569426498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (641266993) 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, 1853198 + ... + 1853543.
It is an arithmetic number, because the mean of its divisors is an integer number (161243277).
Almost surely, 2641266193 is an apocalyptic number.
It is an amenable number.
641266193 is a deficient number, since it is larger than the sum of its proper divisors (3706915).
641266193 is a wasteful number, since it uses less digits than its factorization.
641266193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3706914.
The product of its digits is 46656, while the sum is 38.
The square root of 641266193 is about 25323.2342523620. The cubic root of 641266193 is about 862.3418204076.
The spelling of 641266193 in words is "six hundred forty-one million, two hundred sixty-six thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •