Base | Representation |
---|---|
bin | 1010001001101101… |
… | …11101011100100001 |
3 | 112001211120010202112 |
4 | 11010312331130201 |
5 | 42130224203231 |
6 | 2300453125105 |
7 | 252030103043 |
oct | 50466753441 |
9 | 15054503675 |
10 | 5450225441 |
11 | 2347568051 |
12 | 1081329795 |
13 | 68b20708b |
14 | 399bbba93 |
15 | 21d73b92b |
hex | 144dbd721 |
5450225441 has 2 divisors, whose sum is σ = 5450225442. Its totient is φ = 5450225440.
The previous prime is 5450225399. The next prime is 5450225453. The reversal of 5450225441 is 1445220545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5013206416 + 437019025 = 70804^2 + 20905^2 .
It is a cyclic number.
It is not a de Polignac number, because 5450225441 - 214 = 5450209057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5450225398 and 5450225407.
It is not a weakly prime, because it can be changed into another prime (5450225141) 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 as a sum of consecutive naturals, namely, 2725112720 + 2725112721.
It is an arithmetic number, because the mean of its divisors is an integer number (2725112721).
Almost surely, 25450225441 is an apocalyptic number.
It is an amenable number.
5450225441 is a deficient number, since it is larger than the sum of its proper divisors (1).
5450225441 is an equidigital number, since it uses as much as digits as its factorization.
5450225441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32000, while the sum is 32.
The square root of 5450225441 is about 73825.6421644946. The cubic root of 5450225441 is about 1759.8331282258.
Adding to 5450225441 its reverse (1445220545), we get a palindrome (6895445986).
The spelling of 5450225441 in words is "five billion, four hundred fifty million, two hundred twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •