Base | Representation |
---|---|
bin | 101010011011110001… |
… | …000110000110100101 |
3 | 11100121100211210122012 |
4 | 222123301012012211 |
5 | 1221303112331433 |
6 | 32533101244005 |
7 | 3202044131126 |
oct | 523361060645 |
9 | 140540753565 |
10 | 45563011493 |
11 | 1836114a9aa |
12 | 89b6b63605 |
13 | 43b1758b3c |
14 | 22c334804d |
15 | 12ba0a1848 |
hex | a9bc461a5 |
45563011493 has 2 divisors, whose sum is σ = 45563011494. Its totient is φ = 45563011492.
The previous prime is 45563011471. The next prime is 45563011513. The reversal of 45563011493 is 39411036554.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32106547489 + 13456464004 = 179183^2 + 116002^2 .
It is a cyclic number.
It is not a de Polignac number, because 45563011493 - 212 = 45563007397 is a prime.
It is a super-2 number, since 2×455630114932 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 45563011493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45563019493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22781505746 + 22781505747.
It is an arithmetic number, because the mean of its divisors is an integer number (22781505747).
Almost surely, 245563011493 is an apocalyptic number.
It is an amenable number.
45563011493 is a deficient number, since it is larger than the sum of its proper divisors (1).
45563011493 is an equidigital number, since it uses as much as digits as its factorization.
45563011493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 45563011493 in words is "forty-five billion, five hundred sixty-three million, eleven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •