Base | Representation |
---|---|
bin | 10011001011001011001011… |
… | …10100000111001010010001 |
3 | 12112021222021101000100110122 |
4 | 21211211211310013022101 |
5 | 21011314220414320330 |
6 | 225402303542240025 |
7 | 11611230654200513 |
oct | 1145454564071221 |
9 | 175258241010418 |
10 | 42165402104465 |
11 | 12487279269062 |
12 | 488bb2ba26015 |
13 | 1a6b246324763 |
14 | a5ab600d1bb3 |
15 | 4d1c43a6a5e5 |
hex | 265965d07291 |
42165402104465 has 4 divisors (see below), whose sum is σ = 50598482525364. Its totient is φ = 33732321683568.
The previous prime is 42165402104447. The next prime is 42165402104491. The reversal of 42165402104465 is 56440120456124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 26194732650241 + 15970669454224 = 5118079^2 + 3996332^2 .
It is a cyclic number.
It is not a de Polignac number, because 42165402104465 - 210 = 42165402103441 is a prime.
It is a super-2 number, since 2×421654021044652 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4216540210442 + ... + 4216540210451.
It is an arithmetic number, because the mean of its divisors is an integer number (12649620631341).
Almost surely, 242165402104465 is an apocalyptic number.
It is an amenable number.
42165402104465 is a deficient number, since it is larger than the sum of its proper divisors (8433080420899).
42165402104465 is an equidigital number, since it uses as much as digits as its factorization.
42165402104465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8433080420898.
The product of its (nonzero) digits is 921600, while the sum is 44.
The spelling of 42165402104465 in words is "forty-two trillion, one hundred sixty-five billion, four hundred two million, one hundred four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •