Base | Representation |
---|---|
bin | 11000010010000111010… |
… | …010011000011110011011 |
3 | 12220112020202112111120211 |
4 | 120102013102120132123 |
5 | 204320013031210401 |
6 | 3314333101431551 |
7 | 231363235631641 |
oct | 30220722303633 |
9 | 5815222474524 |
10 | 1668717053851 |
11 | 593776301091 |
12 | 22b4a9b6b5b7 |
13 | c1489626b53 |
14 | 5aaa2b81191 |
15 | 2d619272951 |
hex | 1848749879b |
1668717053851 has 8 divisors (see below), whose sum is σ = 1681565927184. Its totient is φ = 1655869856160.
The previous prime is 1668717053819. The next prime is 1668717053881. The reversal of 1668717053851 is 1583507178661.
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 1668717053851 - 25 = 1668717053819 is a prime.
It is a super-3 number, since 3×16687170538513 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1668717053881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1618485 + ... + 2440681.
It is an arithmetic number, because the mean of its divisors is an integer number (210195740898).
Almost surely, 21668717053851 is an apocalyptic number.
1668717053851 is a deficient number, since it is larger than the sum of its proper divisors (12848873333).
1668717053851 is a wasteful number, since it uses less digits than its factorization.
1668717053851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 837821.
The product of its (nonzero) digits is 8467200, while the sum is 58.
The spelling of 1668717053851 in words is "one trillion, six hundred sixty-eight billion, seven hundred seventeen million, fifty-three thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •