Base | Representation |
---|---|
bin | 10100100010011111001010… |
… | …01011011111101100101001 |
3 | 12220220202212012110101212122 |
4 | 22101033211023133230221 |
5 | 21404442243041111241 |
6 | 240020413232321025 |
7 | 12341044235421353 |
oct | 1221174513375451 |
9 | 186822765411778 |
10 | 45165426113321 |
11 | 13433605642a68 |
12 | 50954419a3175 |
13 | 1c28109b0c687 |
14 | b220382780d3 |
15 | 534cca45304b |
hex | 2913e52dfb29 |
45165426113321 has 4 divisors (see below), whose sum is σ = 45737140368000. Its totient is φ = 44593711858644.
The previous prime is 45165426113317. The next prime is 45165426113329. The reversal of 45165426113321 is 12331162456154.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 45165426113321 - 22 = 45165426113317 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45165426113329) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285857127221 + ... + 285857127378.
It is an arithmetic number, because the mean of its divisors is an integer number (11434285092000).
Almost surely, 245165426113321 is an apocalyptic number.
It is an amenable number.
45165426113321 is a deficient number, since it is larger than the sum of its proper divisors (571714254679).
45165426113321 is an equidigital number, since it uses as much as digits as its factorization.
45165426113321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571714254678.
The product of its digits is 518400, while the sum is 44.
Adding to 45165426113321 its reverse (12331162456154), we get a palindrome (57496588569475).
The spelling of 45165426113321 in words is "forty-five trillion, one hundred sixty-five billion, four hundred twenty-six million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •