Base | Representation |
---|---|
bin | 110000100100110010110… |
… | …0000010100000010011001 |
3 | 212122020010122101011002120 |
4 | 1201021211200110002121 |
5 | 1333340104012204411 |
6 | 22110541053451453 |
7 | 1256221352643225 |
oct | 141114540240231 |
9 | 25566118334076 |
10 | 6676082147481 |
11 | 214434636648a |
12 | 8b9a524a0b89 |
13 | 395723533386 |
14 | 1911a475d785 |
15 | b89d8379106 |
hex | 61265814099 |
6676082147481 has 8 divisors (see below), whose sum is σ = 8956052942880. Its totient is φ = 4423416391872.
The previous prime is 6676082147479. The next prime is 6676082147489. The reversal of 6676082147481 is 1847412806766.
6676082147481 is digitally balanced in base 3, 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 not a de Polignac number, because 6676082147481 - 21 = 6676082147479 is a prime.
It is a super-2 number, since 2×66760821474812 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6676082147489) 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, 6826259376 + ... + 6826260353.
It is an arithmetic number, because the mean of its divisors is an integer number (1119506617860).
Almost surely, 26676082147481 is an apocalyptic number.
It is an amenable number.
6676082147481 is a deficient number, since it is larger than the sum of its proper divisors (2279970795399).
6676082147481 is a wasteful number, since it uses less digits than its factorization.
6676082147481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13652519895.
The product of its (nonzero) digits is 21676032, while the sum is 60.
The spelling of 6676082147481 in words is "six trillion, six hundred seventy-six billion, eighty-two million, one hundred forty-seven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •