Base | Representation |
---|---|
bin | 1100011010011100… |
… | …11010010000011001 |
3 | 122012110010011021201 |
4 | 12031032122100121 |
5 | 102122032113223 |
6 | 3021143434201 |
7 | 324101614162 |
oct | 61516322031 |
9 | 18173104251 |
10 | 6664332313 |
11 | 290a929561 |
12 | 135ba55961 |
13 | 8228ca502 |
14 | 473140769 |
15 | 290111ead |
hex | 18d39a419 |
6664332313 has 4 divisors (see below), whose sum is σ = 6666499840. Its totient is φ = 6662164788.
The previous prime is 6664332281. The next prime is 6664332319. The reversal of 6664332313 is 3132334666.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6664332313 - 25 = 6664332281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6664332319) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1079145 + ... + 1085302.
It is an arithmetic number, because the mean of its divisors is an integer number (1666624960).
Almost surely, 26664332313 is an apocalyptic number.
It is an amenable number.
6664332313 is a deficient number, since it is larger than the sum of its proper divisors (2167527).
6664332313 is a wasteful number, since it uses less digits than its factorization.
6664332313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2167526.
The product of its digits is 139968, while the sum is 37.
The square root of 6664332313 is about 81635.3619027931. The cubic root of 6664332313 is about 1881.8523610271.
Adding to 6664332313 its reverse (3132334666), we get a palindrome (9796666979).
It can be divided in two parts, 666433 and 2313, that added together give a triangular number (668746 = T1156).
The spelling of 6664332313 in words is "six billion, six hundred sixty-four million, three hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •