Base | Representation |
---|---|
bin | 101010001100011010… |
… | …100011101100010101 |
3 | 11022221102012002000200 |
4 | 222030122203230111 |
5 | 1220241143221031 |
6 | 32451340531113 |
7 | 3162465633615 |
oct | 521432435425 |
9 | 138842162020 |
10 | 45305445141 |
11 | 18239819550 |
12 | 8944850a99 |
13 | 4370297508 |
14 | 229b05ca45 |
15 | 12a26758e6 |
hex | a8c6a3b15 |
45305445141 has 24 divisors (see below), whose sum is σ = 73852140960. Its totient is φ = 26511021600.
The previous prime is 45305445037. The next prime is 45305445151. The reversal of 45305445141 is 14154450354.
45305445141 is a `hidden beast` number, since 45 + 30 + 5 + 445 + 141 = 666.
It is not a de Polignac number, because 45305445141 - 27 = 45305445013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45305445096 and 45305445105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45305445151) 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 in 23 ways as a sum of consecutive naturals, for example, 7887315 + ... + 7893056.
It is an arithmetic number, because the mean of its divisors is an integer number (3077172540).
Almost surely, 245305445141 is an apocalyptic number.
It is an amenable number.
45305445141 is a deficient number, since it is larger than the sum of its proper divisors (28546695819).
45305445141 is a wasteful number, since it uses less digits than its factorization.
45305445141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15780417 (or 15780414 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
Adding to 45305445141 its reverse (14154450354), we get a palindrome (59459895495).
The spelling of 45305445141 in words is "forty-five billion, three hundred five million, four hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •