Base | Representation |
---|---|
bin | 110000100100011110101… |
… | …0001111111101110101001 |
3 | 212122011101121112122010100 |
4 | 1201020331101333232221 |
5 | 1333332213232240031 |
6 | 22110350105340013 |
7 | 1256165546613264 |
oct | 141107521775651 |
9 | 25564347478110 |
10 | 6675407305641 |
11 | 214402a43a858 |
12 | 8b98a4497609 |
13 | 395646792189 |
14 | 19113cc93cdb |
15 | b8998ec5de6 |
hex | 6123d47fba9 |
6675407305641 has 6 divisors (see below), whose sum is σ = 9642254997050. Its totient is φ = 4450271537088.
The previous prime is 6675407305621. The next prime is 6675407305663. The reversal of 6675407305641 is 1465037045766.
6675407305641 is a `hidden beast` number, since 6 + 6 + 7 + 5 + 4 + 0 + 73 + 0 + 564 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 6671501555625 + 3905750016 = 2582925^2 + 62496^2 .
It is not a de Polignac number, because 6675407305641 - 27 = 6675407305513 is a prime.
It is a super-2 number, since 2×66754073056412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6675407305601) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 370855961416 + ... + 370855961433.
Almost surely, 26675407305641 is an apocalyptic number.
It is an amenable number.
6675407305641 is a deficient number, since it is larger than the sum of its proper divisors (2966847691409).
6675407305641 is a wasteful number, since it uses less digits than its factorization.
6675407305641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 741711922855 (or 741711922852 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 54.
The spelling of 6675407305641 in words is "six trillion, six hundred seventy-five billion, four hundred seven million, three hundred five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •