Base | Representation |
---|---|
bin | 1010010010110000100… |
… | …11000001011101110001 |
3 | 1020210212210001110200101 |
4 | 11021120103001131301 |
5 | 21243303141400032 |
6 | 430250111352401 |
7 | 34360145230453 |
oct | 5113023013561 |
9 | 1223783043611 |
10 | 353668700017 |
11 | 126a98840a36 |
12 | 58662b22701 |
13 | 27473983639 |
14 | 13190bc62d3 |
15 | 92ee185de7 |
hex | 52584c1771 |
353668700017 has 4 divisors (see below), whose sum is σ = 354512778480. Its totient is φ = 352824621556.
The previous prime is 353668699999. The next prime is 353668700053. The reversal of 353668700017 is 710007866353.
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-353668700017 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 353668700017.
It is not an unprimeable number, because it can be changed into a prime (353668730017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 422038603 + ... + 422039440.
It is an arithmetic number, because the mean of its divisors is an integer number (88628194620).
Almost surely, 2353668700017 is an apocalyptic number.
It is an amenable number.
353668700017 is a deficient number, since it is larger than the sum of its proper divisors (844078463).
353668700017 is an equidigital number, since it uses as much as digits as its factorization.
353668700017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844078462.
The product of its (nonzero) digits is 635040, while the sum is 46.
The spelling of 353668700017 in words is "three hundred fifty-three billion, six hundred sixty-eight million, seven hundred thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •