Base | Representation |
---|---|
bin | 10100101100011010100011… |
… | …11001111100010110111101 |
3 | 12222010101100220012201010201 |
4 | 22112031101321330112331 |
5 | 21431034404434120203 |
6 | 240441231030003501 |
7 | 12404511540202633 |
oct | 1226152171742675 |
9 | 188111326181121 |
10 | 45506552645053 |
11 | 13555247684265 |
12 | 512b5844a6591 |
13 | 1c51332200956 |
14 | b34759431353 |
15 | 53dae3470e1d |
hex | 296351e7c5bd |
45506552645053 has 4 divisors (see below), whose sum is σ = 45506877667168. Its totient is φ = 45506227622940.
The previous prime is 45506552645033. The next prime is 45506552645089. The reversal of 45506552645053 is 35054625560554.
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 45506552645053 - 29 = 45506552644541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45506552644985 and 45506552645003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45506552645033) 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, 162300951 + ... + 162581092.
It is an arithmetic number, because the mean of its divisors is an integer number (11376719416792).
Almost surely, 245506552645053 is an apocalyptic number.
It is an amenable number.
45506552645053 is a deficient number, since it is larger than the sum of its proper divisors (325022115).
45506552645053 is a wasteful number, since it uses less digits than its factorization.
45506552645053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325022114.
The product of its (nonzero) digits is 54000000, while the sum is 55.
The spelling of 45506552645053 in words is "forty-five trillion, five hundred six billion, five hundred fifty-two million, six hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •