Base | Representation |
---|---|
bin | 101011101100010110000… |
… | …1011100010001100101101 |
3 | 210021002020010102212120212 |
4 | 1113120230023202030231 |
5 | 1241341424002012343 |
6 | 20434412443352205 |
7 | 1156566053361515 |
oct | 127305413421455 |
9 | 23232203385525 |
10 | 6005105500973 |
11 | 1a05829558947 |
12 | 80b9b5822665 |
13 | 347382009ca7 |
14 | 16a911cb4845 |
15 | a63172cdc18 |
hex | 5762c2e232d |
6005105500973 has 2 divisors, whose sum is σ = 6005105500974. Its totient is φ = 6005105500972.
The previous prime is 6005105500951. The next prime is 6005105501023. The reversal of 6005105500973 is 3790055015006.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4363432187689 + 1641673313284 = 2088883^2 + 1281278^2 .
It is a cyclic number.
It is not a de Polignac number, because 6005105500973 - 230 = 6004031759149 is a prime.
It is a super-2 number, since 2×60051055009732 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6005105500973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6005105500903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3002552750486 + 3002552750487.
It is an arithmetic number, because the mean of its divisors is an integer number (3002552750487).
Almost surely, 26005105500973 is an apocalyptic number.
It is an amenable number.
6005105500973 is a deficient number, since it is larger than the sum of its proper divisors (1).
6005105500973 is an equidigital number, since it uses as much as digits as its factorization.
6005105500973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141750, while the sum is 41.
The spelling of 6005105500973 in words is "six trillion, five billion, one hundred five million, five hundred thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •