Base | Representation |
---|---|
bin | 110000100011101110111… |
… | …0100011100011111111001 |
3 | 212122000020222212211122111 |
4 | 1201013131310130133321 |
5 | 1333320423231124031 |
6 | 22105523134052321 |
7 | 1256111061444100 |
oct | 141073564343771 |
9 | 25560228784574 |
10 | 6673805723641 |
11 | 2143388388571 |
12 | 8b951804a0a1 |
13 | 39544ca24314 |
14 | 19102a2ab037 |
15 | b89035b31b1 |
hex | 611ddd1c7f9 |
6673805723641 has 45 divisors (see below), whose sum is σ = 8255078191659. Its totient is φ = 5379694438272.
The previous prime is 6673805723639. The next prime is 6673805723657. The reversal of 6673805723641 is 1463275083766.
The square root of 6673805723641 is 2583371.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 8135138025 + 6665670585616 = 90195^2 + 2581796^2 .
It is not a de Polignac number, because 6673805723641 - 21 = 6673805723639 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6673805703641) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 5226158895 + ... + 5226160171.
Almost surely, 26673805723641 is an apocalyptic number.
6673805723641 is the 2583371-st square number.
6673805723641 is the 1291686-th centered octagonal number.
It is an amenable number.
6673805723641 is a deficient number, since it is larger than the sum of its proper divisors (1581272468018).
6673805723641 is an frugal number, since it uses more digits than its factorization.
6673805723641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2636 (or 1301 counting only the distinct ones).
The product of its (nonzero) digits is 30481920, while the sum is 58.
The spelling of 6673805723641 in words is "six trillion, six hundred seventy-three billion, eight hundred five million, seven hundred twenty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •