Base | Representation |
---|---|
bin | 101100011001111101010… |
… | …0000001000001001110101 |
3 | 210121110001111010022210202 |
4 | 1120303322200020021311 |
5 | 1244443024402130300 |
6 | 20551412204530245 |
7 | 1166634265331345 |
oct | 130637240101165 |
9 | 23543044108722 |
10 | 6103056286325 |
11 | 1a43323192719 |
12 | 826991250985 |
13 | 35369210058b |
14 | 171564b08d25 |
15 | a8b4b683ad5 |
hex | 58cfa808275 |
6103056286325 has 24 divisors (see below), whose sum is σ = 7598034224448. Its totient is φ = 4862936494080.
The previous prime is 6103056286297. The next prime is 6103056286331. The reversal of 6103056286325 is 5236826503016.
It is not a de Polignac number, because 6103056286325 - 210 = 6103056285301 is a prime.
It is a super-2 number, since 2×61030562863252 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6103056286325.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 68465234 + ... + 68554316.
It is an arithmetic number, because the mean of its divisors is an integer number (316584759352).
Almost surely, 26103056286325 is an apocalyptic number.
It is an amenable number.
6103056286325 is a deficient number, since it is larger than the sum of its proper divisors (1494977938123).
6103056286325 is a wasteful number, since it uses less digits than its factorization.
6103056286325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100013 (or 100008 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 6103056286325 in words is "six trillion, one hundred three billion, fifty-six million, two hundred eighty-six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •