Base | Representation |
---|---|
bin | 101010000100000100… |
… | …011000010010011101 |
3 | 11022120122200201202211 |
4 | 222010010120102131 |
5 | 1214444321213113 |
6 | 32425415320421 |
7 | 3156145452322 |
oct | 520404302235 |
9 | 138518621684 |
10 | 45165413533 |
11 | 18177775749 |
12 | 8905980111 |
13 | 434a278986 |
14 | 228660ab49 |
15 | 1295214b3d |
hex | a8411849d |
45165413533 has 4 divisors (see below), whose sum is σ = 45166506588. Its totient is φ = 45164320480.
The previous prime is 45165413477. The next prime is 45165413567. The reversal of 45165413533 is 33531456154.
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 37315807929 + 7849605604 = 193173^2 + 88598^2 .
It is a cyclic number.
It is not a de Polignac number, because 45165413533 - 221 = 45163316381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45165413933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 482008 + ... + 568033.
It is an arithmetic number, because the mean of its divisors is an integer number (11291626647).
Almost surely, 245165413533 is an apocalyptic number.
It is an amenable number.
45165413533 is a deficient number, since it is larger than the sum of its proper divisors (1093055).
45165413533 is a wasteful number, since it uses less digits than its factorization.
45165413533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093054.
The product of its digits is 324000, while the sum is 40.
Adding to 45165413533 its reverse (33531456154), we get a palindrome (78696869687).
The spelling of 45165413533 in words is "forty-five billion, one hundred sixty-five million, four hundred thirteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •