Base | Representation |
---|---|
bin | 11000010001101111101… |
… | …000101110011001111101 |
3 | 12220111020002220011112122 |
4 | 120101233220232121331 |
5 | 204313204441221121 |
6 | 3314225445012325 |
7 | 231350350132511 |
oct | 30215750563175 |
9 | 5814202804478 |
10 | 1668320257661 |
11 | 593592324252 |
12 | 22b3b90b40a5 |
13 | c14253678c5 |
14 | 5aa661b2141 |
15 | 2d5e44e35ab |
hex | 1846fa2e67d |
1668320257661 has 4 divisors (see below), whose sum is σ = 1707118403232. Its totient is φ = 1629522112092.
The previous prime is 1668320257657. The next prime is 1668320257693. The reversal of 1668320257661 is 1667520238661.
It is a happy number.
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 1668320257661 - 22 = 1668320257657 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1668320257621) 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 3 ways as a sum of consecutive naturals, for example, 19399072721 + ... + 19399072806.
It is an arithmetic number, because the mean of its divisors is an integer number (426779600808).
Almost surely, 21668320257661 is an apocalyptic number.
It is an amenable number.
1668320257661 is a deficient number, since it is larger than the sum of its proper divisors (38798145571).
1668320257661 is an equidigital number, since it uses as much as digits as its factorization.
1668320257661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38798145570.
The product of its (nonzero) digits is 4354560, while the sum is 53.
The spelling of 1668320257661 in words is "one trillion, six hundred sixty-eight billion, three hundred twenty million, two hundred fifty-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •