Base | Representation |
---|---|
bin | 10100101101100010100111… |
… | …10111101000101001101101 |
3 | 12222021002020002212012212002 |
4 | 22112301103313220221231 |
5 | 21432203123004101031 |
6 | 240511110004422045 |
7 | 12410351340636161 |
oct | 1226612367505155 |
9 | 188232202765762 |
10 | 45545240300141 |
11 | 1356a69a87312a |
12 | 5136b809a7925 |
13 | 1c54b8941525a |
14 | b365895c6ca1 |
15 | 53eb09b29ccb |
hex | 296c53de8a6d |
45545240300141 has 16 divisors (see below), whose sum is σ = 46864869739776. Its totient is φ = 44237635577856.
The previous prime is 45545240300129. The next prime is 45545240300143. The reversal of 45545240300141 is 14100304254554.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-45545240300141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45545240300095 and 45545240300104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45545240300143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19413836 + ... + 21633018.
It is an arithmetic number, because the mean of its divisors is an integer number (2929054358736).
Almost surely, 245545240300141 is an apocalyptic number.
It is an amenable number.
45545240300141 is a deficient number, since it is larger than the sum of its proper divisors (1319629439635).
45545240300141 is a wasteful number, since it uses less digits than its factorization.
45545240300141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2221892.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 45545240300141 its reverse (14100304254554), we get a palindrome (59645544554695).
The spelling of 45545240300141 in words is "forty-five trillion, five hundred forty-five billion, two hundred forty million, three hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •