Base | Representation |
---|---|
bin | 101101001001111011100… |
… | …0011010100111101001001 |
3 | 210222021222012221022202012 |
4 | 1122103313003110331021 |
5 | 1303140021332320131 |
6 | 21111011021345305 |
7 | 1210242250245065 |
oct | 132236703247511 |
9 | 23867865838665 |
10 | 6206077620041 |
11 | 1a82a8a02a532 |
12 | 842942a08235 |
13 | 3602cc853a40 |
14 | 176539126aa5 |
15 | ab67ac7852b |
hex | 5a4f70d4f49 |
6206077620041 has 4 divisors (see below), whose sum is σ = 6683468206212. Its totient is φ = 5728687033872.
The previous prime is 6206077620023. The next prime is 6206077620079. The reversal of 6206077620041 is 1400267706026.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 719104000000 + 5486973620041 = 848000^2 + 2342429^2 .
It is a cyclic number.
It is not a de Polignac number, because 6206077620041 - 26 = 6206077619977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6206077626041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 238695293066 + ... + 238695293091.
It is an arithmetic number, because the mean of its divisors is an integer number (1670867051553).
Almost surely, 26206077620041 is an apocalyptic number.
It is an amenable number.
6206077620041 is a deficient number, since it is larger than the sum of its proper divisors (477390586171).
6206077620041 is a wasteful number, since it uses less digits than its factorization.
6206077620041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477390586170.
The product of its (nonzero) digits is 169344, while the sum is 41.
The spelling of 6206077620041 in words is "six trillion, two hundred six billion, seventy-seven million, six hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •