Base | Representation |
---|---|
bin | 100111000000001110010… |
… | …111111000011100101011 |
3 | 100111020022202200212021212 |
4 | 213000032113320130223 |
5 | 322403223441444001 |
6 | 5411151350423335 |
7 | 364434231222650 |
oct | 47001627703453 |
9 | 10436282625255 |
10 | 2680300734251 |
11 | 943788986568 |
12 | 373563361b4b |
13 | 16599c72073a |
14 | 93a277d3c27 |
15 | 49ac29207bb |
hex | 2700e5f872b |
2680300734251 has 8 divisors (see below), whose sum is σ = 3120997081824. Its totient is φ = 2254053447360.
The previous prime is 2680300734233. The next prime is 2680300734263. The reversal of 2680300734251 is 1524370030862.
2680300734251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2680300734251 - 26 = 2680300734187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2680300734199 and 2680300734208.
It is not an unprimeable number, because it can be changed into a prime (2680300734271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3612264770 + ... + 3612265511.
It is an arithmetic number, because the mean of its divisors is an integer number (390124635228).
Almost surely, 22680300734251 is an apocalyptic number.
2680300734251 is a deficient number, since it is larger than the sum of its proper divisors (440696347573).
2680300734251 is an equidigital number, since it uses as much as digits as its factorization.
2680300734251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7224530341.
The product of its (nonzero) digits is 241920, while the sum is 41.
The spelling of 2680300734251 in words is "two trillion, six hundred eighty billion, three hundred million, seven hundred thirty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •