Base | Representation |
---|---|
bin | 101011110011101110001… |
… | …0010100001010101000001 |
3 | 210022121010000022000210202 |
4 | 1113213130102201111001 |
5 | 1242121343411234241 |
6 | 20445552311334545 |
7 | 1160666426166053 |
oct | 127473422412501 |
9 | 23277100260722 |
10 | 6020945024321 |
11 | 1a11517556207 |
12 | 812a96381455 |
13 | 348a07766806 |
14 | 16b5b57d18d3 |
15 | a6942b75d9b |
hex | 579dc4a1541 |
6020945024321 has 4 divisors (see below), whose sum is σ = 6088596092100. Its totient is φ = 5953293956544.
The previous prime is 6020945024317. The next prime is 6020945024363. The reversal of 6020945024321 is 1234205490206.
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 2507329737025 + 3513615287296 = 1583455^2 + 1874464^2 .
It is a cyclic number.
It is not a de Polignac number, because 6020945024321 - 22 = 6020945024317 is a prime.
It is a super-2 number, since 2×60209450243212 (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 (6020945029321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33825533756 + ... + 33825533933.
It is an arithmetic number, because the mean of its divisors is an integer number (1522149023025).
Almost surely, 26020945024321 is an apocalyptic number.
It is an amenable number.
6020945024321 is a deficient number, since it is larger than the sum of its proper divisors (67651067779).
6020945024321 is an equidigital number, since it uses as much as digits as its factorization.
6020945024321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67651067778.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 6020945024321 in words is "six trillion, twenty billion, nine hundred forty-five million, twenty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •