Base | Representation |
---|---|
bin | 11000010001011110111… |
… | …101100011111111010011 |
3 | 12220110111121111101020220 |
4 | 120101132331203333103 |
5 | 204312121332213342 |
6 | 3314142013004123 |
7 | 231340412242104 |
oct | 30213675437723 |
9 | 5813447441226 |
10 | 1668040507347 |
11 | 593459420745 |
12 | 22b33b483643 |
13 | c13ac409a86 |
14 | 5aa3ad903ab |
15 | 2d5c9b845ec |
hex | 1845ef63fd3 |
1668040507347 has 8 divisors (see below), whose sum is σ = 2243735904144. Its totient is φ = 1102186057728.
The previous prime is 1668040507339. The next prime is 1668040507361. The reversal of 1668040507347 is 7437050408661.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1668040507347 - 23 = 1668040507339 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 1668040507347.
It is not an unprimeable number, because it can be changed into a prime (1668040503347) 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, 2460236398 + ... + 2460237075.
It is an arithmetic number, because the mean of its divisors is an integer number (280466988018).
Almost surely, 21668040507347 is an apocalyptic number.
1668040507347 is a deficient number, since it is larger than the sum of its proper divisors (575695396797).
1668040507347 is a wasteful number, since it uses less digits than its factorization.
1668040507347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4920473589.
The product of its (nonzero) digits is 3386880, while the sum is 51.
The spelling of 1668040507347 in words is "one trillion, six hundred sixty-eight billion, forty million, five hundred seven thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •