Base | Representation |
---|---|
bin | 11000010001111100010… |
… | …110010100000100111101 |
3 | 12220111202222012210002201 |
4 | 120101330112110010331 |
5 | 204314124041110122 |
6 | 3314302544151501 |
7 | 231355550016445 |
oct | 30217426240475 |
9 | 5814688183081 |
10 | 1668533535037 |
11 | 593691755746 |
12 | 22b458608591 |
13 | c145a5c0435 |
14 | 5aa8664d125 |
15 | 2d6080c1a27 |
hex | 1847c59413d |
1668533535037 has 4 divisors (see below), whose sum is σ = 1681671594496. Its totient is φ = 1655395475580.
The previous prime is 1668533534981. The next prime is 1668533535049. The reversal of 1668533535037 is 7305353358661.
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 a de Polignac number, because none of the positive numbers 2k-1668533535037 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 (1668533535077) 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 3 ways as a sum of consecutive naturals, for example, 6569029539 + ... + 6569029792.
It is an arithmetic number, because the mean of its divisors is an integer number (420417898624).
Almost surely, 21668533535037 is an apocalyptic number.
It is an amenable number.
1668533535037 is a deficient number, since it is larger than the sum of its proper divisors (13138059459).
1668533535037 is a wasteful number, since it uses less digits than its factorization.
1668533535037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13138059458.
The product of its (nonzero) digits is 20412000, while the sum is 55.
The spelling of 1668533535037 in words is "one trillion, six hundred sixty-eight billion, five hundred thirty-three million, five hundred thirty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •