Base | Representation |
---|---|
bin | 110000001011100110101… |
… | …1011100010110001001000 |
3 | 212110001111221121220122221 |
4 | 1200113031123202301020 |
5 | 1331443314213341322 |
6 | 22030033432023424 |
7 | 1252265054036065 |
oct | 140271533426110 |
9 | 25401457556587 |
10 | 6621991152712 |
11 | 2123409409521 |
12 | 8ab477531b74 |
13 | 3905b30622b0 |
14 | 18c71298dc6c |
15 | b73be7879c7 |
hex | 605cd6e2c48 |
6621991152712 has 64 divisors (see below), whose sum is σ = 14159567318400. Its totient is φ = 2876177617920.
The previous prime is 6621991152697. The next prime is 6621991152719. The reversal of 6621991152712 is 2172511991266.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a self number, because there is not a number n which added to its sum of digits gives 6621991152712.
It is not an unprimeable number, because it can be changed into a prime (6621991152719) 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 15 ways as a sum of consecutive naturals, for example, 14877637 + ... + 15316267.
It is an arithmetic number, because the mean of its divisors is an integer number (221243239350).
Almost surely, 26621991152712 is an apocalyptic number.
It is an amenable number.
6621991152712 is an abundant number, since it is smaller than the sum of its proper divisors (7537576165688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6621991152712 is a wasteful number, since it uses less digits than its factorization.
6621991152712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447206 (or 447202 counting only the distinct ones).
The product of its digits is 816480, while the sum is 52.
The spelling of 6621991152712 in words is "six trillion, six hundred twenty-one billion, nine hundred ninety-one million, one hundred fifty-two thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •