Base | Representation |
---|---|
bin | 101011101100100011010… |
… | …1111000001000100000011 |
3 | 210021010101011202002011002 |
4 | 1113121012233001010003 |
5 | 1241343332024310201 |
6 | 20434525000242215 |
7 | 1156613103215015 |
oct | 127310657010403 |
9 | 23233334662132 |
10 | 6005551010051 |
11 | 1a05a37a8746a |
12 | 80babaa7036b |
13 | 3474233c3828 |
14 | 16a9551241b5 |
15 | a634148176b |
hex | 57646bc1103 |
6005551010051 has 8 divisors (see below), whose sum is σ = 6013934148864. Its totient is φ = 5997172494600.
The previous prime is 6005551010009. The next prime is 6005551010111. The reversal of 6005551010051 is 1500101555006.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6005551010051 - 26 = 6005551009987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6005551009996 and 6005551010023.
It is not an unprimeable number, because it can be changed into a prime (6005551010651) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1447976 + ... + 3756026.
It is an arithmetic number, because the mean of its divisors is an integer number (751741768608).
Almost surely, 26005551010051 is an apocalyptic number.
6005551010051 is a deficient number, since it is larger than the sum of its proper divisors (8383138813).
6005551010051 is a wasteful number, since it uses less digits than its factorization.
6005551010051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2311681.
The product of its (nonzero) digits is 3750, while the sum is 29.
Adding to 6005551010051 its reverse (1500101555006), we get a palindrome (7505652565057).
The spelling of 6005551010051 in words is "six trillion, five billion, five hundred fifty-one million, ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •