Base | Representation |
---|---|
bin | 110000100001110111010… |
… | …1010010111010011101000 |
3 | 212121121220100211221021000 |
4 | 1201003232222113103220 |
5 | 1333234214042420222 |
6 | 22104021042315000 |
7 | 1255606460564514 |
oct | 141035652272350 |
9 | 25547810757230 |
10 | 6669793326312 |
11 | 21417094a7016 |
12 | 8b8798358a60 |
13 | 394c60681b0c |
14 | 190b6944b144 |
15 | b876b1de9ac |
hex | 610eea974e8 |
6669793326312 has 64 divisors (see below), whose sum is σ = 18586776873600. Its totient is φ = 2216115659520.
The previous prime is 6669793326293. The next prime is 6669793326331. The reversal of 6669793326312 is 2136233979666.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (6669793326293) and next prime (6669793326331).
It is a super-2 number, since 2×66697933263122 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6669793326312.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49576993 + ... + 49711344.
It is an arithmetic number, because the mean of its divisors is an integer number (290418388650).
Almost surely, 26669793326312 is an apocalyptic number.
It is an amenable number.
6669793326312 is an abundant number, since it is smaller than the sum of its proper divisors (11916983547288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6669793326312 is a wasteful number, since it uses less digits than its factorization.
6669793326312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99288663 (or 99288653 counting only the distinct ones).
The product of its digits is 79361856, while the sum is 63.
The spelling of 6669793326312 in words is "six trillion, six hundred sixty-nine billion, seven hundred ninety-three million, three hundred twenty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •