Base | Representation |
---|---|
bin | 1010110100110… |
… | …0010100001111 |
3 | 10011102121221211 |
4 | 2231030110033 |
5 | 43110320414 |
6 | 4301035251 |
7 | 1060622323 |
oct | 255142417 |
9 | 104377854 |
10 | 45401359 |
11 | 2369a793 |
12 | 13255b27 |
13 | 9538213 |
14 | 605b983 |
15 | 3ebc3c4 |
hex | 2b4c50f |
45401359 has 2 divisors, whose sum is σ = 45401360. Its totient is φ = 45401358.
The previous prime is 45401353. The next prime is 45401371. The reversal of 45401359 is 95310454.
45401359 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 45401359 - 29 = 45400847 is a prime.
It is a super-3 number, since 3×454013593 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 45401359.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45401353) 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 as a sum of consecutive naturals, namely, 22700679 + 22700680.
It is an arithmetic number, because the mean of its divisors is an integer number (22700680).
Almost surely, 245401359 is an apocalyptic number.
45401359 is a deficient number, since it is larger than the sum of its proper divisors (1).
45401359 is an equidigital number, since it uses as much as digits as its factorization.
45401359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 45401359 is about 6738.0530570781. The cubic root of 45401359 is about 356.7436769493.
The spelling of 45401359 in words is "forty-five million, four hundred one thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •