Base | Representation |
---|---|
bin | 101101001101000101110… |
… | …0111101011000001000000 |
3 | 210222221111020212012121210 |
4 | 1122122023213223001000 |
5 | 1303242421434032343 |
6 | 21114052325450120 |
7 | 1210602406242240 |
oct | 132321347530100 |
9 | 23887436765553 |
10 | 6212865142848 |
11 | 1a85952449911 |
12 | 844117b70940 |
13 | 360b41b24420 |
14 | 1769c0773b20 |
15 | ab926ac1333 |
hex | 5a68b9eb040 |
6212865142848 has 224 divisors, whose sum is σ = 20884273070080. Its totient is φ = 1585700997120.
The previous prime is 6212865142843. The next prime is 6212865142873. The reversal of 6212865142848 is 8482415682126.
It is a tau number, because it is divible by the number of its divisors (224).
It is a super-2 number, since 2×62128651428482 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6212865142843) 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 31 ways as a sum of consecutive naturals, for example, 5193688 + ... + 6276951.
It is an arithmetic number, because the mean of its divisors is an integer number (93233361920).
Almost surely, 26212865142848 is an apocalyptic number.
It is an amenable number.
6212865142848 is an abundant number, since it is smaller than the sum of its proper divisors (14671407927232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6212865142848 is a wasteful number, since it uses less digits than its factorization.
6212865142848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11470705 (or 11470695 counting only the distinct ones).
The product of its digits is 11796480, while the sum is 57.
The spelling of 6212865142848 in words is "six trillion, two hundred twelve billion, eight hundred sixty-five million, one hundred forty-two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •