Base | Representation |
---|---|
bin | 10011110010111110011… |
… | …01010110000001001001 |
3 | 2102000201110101020120121 |
4 | 21321133031112001021 |
5 | 42121023223310340 |
6 | 1240251445023241 |
7 | 100100021005612 |
oct | 11713715260111 |
9 | 2360643336517 |
10 | 680202166345 |
11 | 2425214321a9 |
12 | ab9b23b4b21 |
13 | 4c1b1927680 |
14 | 24cc9c06c09 |
15 | 12a60e7294a |
hex | 9e5f356049 |
680202166345 has 8 divisors (see below), whose sum is σ = 879030491976. Its totient is φ = 502303138176.
The previous prime is 680202166331. The next prime is 680202166471. The reversal of 680202166345 is 543661202086.
680202166345 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 67346478144 + 612855688201 = 259512^2 + 782851^2 .
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 680202166345 - 211 = 680202164297 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5232324292 + ... + 5232324421.
It is an arithmetic number, because the mean of its divisors is an integer number (109878811497).
Almost surely, 2680202166345 is an apocalyptic number.
680202166345 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
680202166345 is a deficient number, since it is larger than the sum of its proper divisors (198828325631).
680202166345 is a wasteful number, since it uses less digits than its factorization.
680202166345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10464648731.
The product of its (nonzero) digits is 414720, while the sum is 43.
The spelling of 680202166345 in words is "six hundred eighty billion, two hundred two million, one hundred sixty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •