Base | Representation |
---|---|
bin | 1010110101101… |
… | …0111101011101 |
3 | 10011112200020101 |
4 | 2231122331131 |
5 | 43114230331 |
6 | 4302221101 |
7 | 1061262232 |
oct | 255327535 |
9 | 104480211 |
10 | 45461341 |
11 | 23730862 |
12 | 13284791 |
13 | 9559603 |
14 | 6075789 |
15 | 3ed0061 |
hex | 2b5af5d |
45461341 has 4 divisors (see below), whose sum is σ = 46009152. Its totient is φ = 44913532.
The previous prime is 45461327. The next prime is 45461347. The reversal of 45461341 is 14316454.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14316454 = 2 ⋅7158227.
It is a cyclic number.
It is not a de Polignac number, because 45461341 - 217 = 45330269 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 (45461347) 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 3 ways as a sum of consecutive naturals, for example, 273781 + ... + 273946.
It is an arithmetic number, because the mean of its divisors is an integer number (11502288).
Almost surely, 245461341 is an apocalyptic number.
It is an amenable number.
45461341 is a deficient number, since it is larger than the sum of its proper divisors (547811).
45461341 is an equidigital number, since it uses as much as digits as its factorization.
45461341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547810.
The product of its digits is 5760, while the sum is 28.
The square root of 45461341 is about 6742.5025769368. The cubic root of 45461341 is about 356.9007117694.
Adding to 45461341 its reverse (14316454), we get a palindrome (59777795).
The spelling of 45461341 in words is "forty-five million, four hundred sixty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •