Base | Representation |
---|---|
bin | 100110100001111… |
… | …110100101100001 |
3 | 1200001101121202212 |
4 | 212201332211201 |
5 | 2310442110223 |
6 | 144051251505 |
7 | 22006442360 |
oct | 4641764541 |
9 | 1601347685 |
10 | 646441313 |
11 | 301998a21 |
12 | 1605a9b95 |
13 | a3c0926b |
14 | 61bd57d7 |
15 | 3bb43278 |
hex | 2687e961 |
646441313 has 8 divisors (see below), whose sum is σ = 777673920. Its totient is φ = 524929680.
The previous prime is 646441261. The next prime is 646441321. The reversal of 646441313 is 313144646.
646441313 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 646441313 - 214 = 646424929 is a prime.
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 646441313.
It is not an unprimeable number, because it can be changed into a prime (646441363) 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, 2430098 + ... + 2430363.
It is an arithmetic number, because the mean of its divisors is an integer number (97209240).
Almost surely, 2646441313 is an apocalyptic number.
It is an amenable number.
646441313 is a deficient number, since it is larger than the sum of its proper divisors (131232607).
646441313 is a wasteful number, since it uses less digits than its factorization.
646441313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4860487.
The product of its digits is 20736, while the sum is 32.
The square root of 646441313 is about 25425.2101859552. The cubic root of 646441313 is about 864.6553531371.
Adding to 646441313 its reverse (313144646), we get a palindrome (959585959).
The spelling of 646441313 in words is "six hundred forty-six million, four hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •