Base | Representation |
---|---|
bin | 101011110000000111100… |
… | …0001111001011001000000 |
3 | 210021212010200122122120201 |
4 | 1113200033001321121000 |
5 | 1242010021312313411 |
6 | 20442232345214544 |
7 | 1160303600543200 |
oct | 127401701713100 |
9 | 23255120578521 |
10 | 6013206369856 |
11 | 1a09206260604 |
12 | 811496791454 |
13 | 34807340922a |
14 | 16b07db18400 |
15 | a663d5a13c1 |
hex | 5780f079640 |
6013206369856 has 63 divisors (see below), whose sum is σ = 13880929531329. Its totient is φ = 2577029591808.
The previous prime is 6013206369811. The next prime is 6013206369883. The reversal of 6013206369856 is 6589636023106.
The square root of 6013206369856 is 2452184.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5083293307456 + 929913062400 = 2254616^2 + 964320^2 .
It is a junction number, because it is equal to n+sod(n) for n = 6013206369797 and 6013206369806.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 137300410 + ... + 137344198.
It is an arithmetic number, because the mean of its divisors is an integer number (220332214783).
Almost surely, 26013206369856 is an apocalyptic number.
6013206369856 is the 2452184-th square number.
It is an amenable number.
6013206369856 is an abundant number, since it is smaller than the sum of its proper divisors (7867723161473).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6013206369856 is an frugal number, since it uses more digits than its factorization.
6013206369856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87604 (or 43798 counting only the distinct ones).
The product of its (nonzero) digits is 8398080, while the sum is 55.
The spelling of 6013206369856 in words is "six trillion, thirteen billion, two hundred six million, three hundred sixty-nine thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •