Base | Representation |
---|---|
bin | 10011011001100111000011… |
… | …01110111000001101101001 |
3 | 12121001101112110222022001112 |
4 | 21230303201232320031221 |
5 | 21042431023000040340 |
6 | 230422213325000105 |
7 | 11662120214531606 |
oct | 1154634156701551 |
9 | 177041473868045 |
10 | 42661402346345 |
11 | 12658665498032 |
12 | 49500953b3035 |
13 | 1aa5c50906c43 |
14 | a76b740256ad |
15 | 4deac3475065 |
hex | 26cce1bb8369 |
42661402346345 has 8 divisors (see below), whose sum is σ = 51193738739976. Its totient is φ = 34129084594176.
The previous prime is 42661402346293. The next prime is 42661402346359. The reversal of 42661402346345 is 54364320416624.
It can be written as a sum of positive squares in 4 ways, for example, as 2733903516304 + 39927498830041 = 1653452^2 + 6318821^2 .
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 42661402346345 - 212 = 42661402342249 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42661402346293 and 42661402346302.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 999209 + ... + 9290921.
It is an arithmetic number, because the mean of its divisors is an integer number (6399217342497).
Almost surely, 242661402346345 is an apocalyptic number.
It is an amenable number.
42661402346345 is a deficient number, since it is larger than the sum of its proper divisors (8532336393631).
42661402346345 is a wasteful number, since it uses less digits than its factorization.
42661402346345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9320731.
The product of its (nonzero) digits is 9953280, while the sum is 50.
The spelling of 42661402346345 in words is "forty-two trillion, six hundred sixty-one billion, four hundred two million, three hundred forty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •