Base | Representation |
---|---|
bin | 1010110110001… |
… | …0011101001001 |
3 | 10011121020100102 |
4 | 2231202131021 |
5 | 43121221131 |
6 | 4303015145 |
7 | 1061450600 |
oct | 255423511 |
9 | 104536312 |
10 | 45492041 |
11 | 23751931 |
12 | 1329a4b5 |
13 | 956a58a |
14 | 6082a37 |
15 | 3ed91cb |
hex | 2b62749 |
45492041 has 6 divisors (see below), whose sum is σ = 52919370. Its totient is φ = 38993136.
The previous prime is 45492019. The next prime is 45492049. The reversal of 45492041 is 14029454.
45492041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 44689225 + 802816 = 6685^2 + 896^2 .
It is a de Polignac number, because none of the positive numbers 2k-45492041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45491995 and 45492013.
It is not an unprimeable number, because it can be changed into a prime (45492049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 464156 + ... + 464253.
It is an arithmetic number, because the mean of its divisors is an integer number (8819895).
Almost surely, 245492041 is an apocalyptic number.
It is an amenable number.
45492041 is a deficient number, since it is larger than the sum of its proper divisors (7427329).
45492041 is an equidigital number, since it uses as much as digits as its factorization.
45492041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928423 (or 928416 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 45492041 is about 6744.7787954832. The cubic root of 45492041 is about 356.9810319283.
The spelling of 45492041 in words is "forty-five million, four hundred ninety-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •