Base | Representation |
---|---|
bin | 101100011011011000000… |
… | …1110010000101100000001 |
3 | 210121201220221220212120011 |
4 | 1120312300032100230001 |
5 | 1300020300343243001 |
6 | 20553034514344521 |
7 | 1200102655415566 |
oct | 130666016205401 |
9 | 23551827825504 |
10 | 6106105056001 |
11 | 1a44648133485 |
12 | 8274a228b141 |
13 | 353a5992c1c2 |
14 | 1717739a886d |
15 | a8c7915cd51 |
hex | 58db0390b01 |
6106105056001 has 16 divisors (see below), whose sum is σ = 6477897541968. Its totient is φ = 5735723929600.
The previous prime is 6106105055993. The next prime is 6106105056013. The reversal of 6106105056001 is 1006505016016.
It can be written as a sum of positive squares in 8 ways, for example, as 2149745372401 + 3956359683600 = 1466201^2 + 1989060^2 .
It is a cyclic number.
It is not a de Polignac number, because 6106105056001 - 23 = 6106105055993 is a prime.
It is a super-2 number, since 2×61061050560012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6106105051001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19003641 + ... + 19322281.
It is an arithmetic number, because the mean of its divisors is an integer number (404868596373).
Almost surely, 26106105056001 is an apocalyptic number.
It is an amenable number.
6106105056001 is a deficient number, since it is larger than the sum of its proper divisors (371792485967).
6106105056001 is a wasteful number, since it uses less digits than its factorization.
6106105056001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320852.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 6106105056001 in words is "six trillion, one hundred six billion, one hundred five million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •