Base | Representation |
---|---|
bin | 10011010101011011111… |
… | …00101101000011011011 |
3 | 2100111210020012010221120 |
4 | 21222231330231003123 |
5 | 41341033343211011 |
6 | 1225110051140323 |
7 | 65666022114240 |
oct | 11525574550333 |
9 | 2314706163846 |
10 | 664343335131 |
11 | 236823547623 |
12 | a89072a46a3 |
13 | 4a85519a788 |
14 | 242239015c7 |
15 | 12433a64a06 |
hex | 9aadf2d0db |
664343335131 has 32 divisors (see below), whose sum is σ = 1015939584000. Its totient is φ = 378274561056.
The previous prime is 664343335111. The next prime is 664343335163. The reversal of 664343335131 is 131533343466.
It is a happy number.
It is not a de Polignac number, because 664343335131 - 211 = 664343333083 is a prime.
It is a super-2 number, since 2×6643433351312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (664343335111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6730920 + ... + 6828906.
It is an arithmetic number, because the mean of its divisors is an integer number (31748112000).
Almost surely, 2664343335131 is an apocalyptic number.
664343335131 is a deficient number, since it is larger than the sum of its proper divisors (351596248869).
664343335131 is a wasteful number, since it uses less digits than its factorization.
664343335131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99143.
The product of its digits is 699840, while the sum is 42.
Adding to 664343335131 its reverse (131533343466), we get a palindrome (795876678597).
It can be divided in two parts, 664343335 and 131, that added together give a palindrome (664343466).
The spelling of 664343335131 in words is "six hundred sixty-four billion, three hundred forty-three million, three hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •