Base | Representation |
---|---|
bin | 101011101100010011100… |
… | …0101110111110000010001 |
3 | 210021002000011210121001212 |
4 | 1113120213011313300101 |
5 | 1241341240123132241 |
6 | 20434400153505505 |
7 | 1156563665626502 |
oct | 127304705676021 |
9 | 23232004717055 |
10 | 6005020130321 |
11 | 1a05795349693 |
12 | 80b991112295 |
13 | 34736a419204 |
14 | 16a904810ba9 |
15 | a630ea68beb |
hex | 57627177c11 |
6005020130321 has 4 divisors (see below), whose sum is σ = 6005026540032. Its totient is φ = 6005013720612.
The previous prime is 6005020130293. The next prime is 6005020130323. The reversal of 6005020130321 is 1230310205006.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 6005020130321 - 230 = 6003946388497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6005020130323) 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, 1495745 + ... + 3774558.
It is an arithmetic number, because the mean of its divisors is an integer number (1501256635008).
Almost surely, 26005020130321 is an apocalyptic number.
It is an amenable number.
6005020130321 is a deficient number, since it is larger than the sum of its proper divisors (6409711).
6005020130321 is a wasteful number, since it uses less digits than its factorization.
6005020130321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6409710.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 6005020130321 its reverse (1230310205006), we get a palindrome (7235330335327).
The spelling of 6005020130321 in words is "six trillion, five billion, twenty million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •