Base | Representation |
---|---|
bin | 1010001001001010… |
… | …10101000001010101 |
3 | 112001111212022112022 |
4 | 11010211111001111 |
5 | 42123033302123 |
6 | 2300210102525 |
7 | 251642602535 |
oct | 50445250125 |
9 | 15044768468 |
10 | 5445603413 |
11 | 23449a0498 |
12 | 107b87aa45 |
13 | 68a279353 |
14 | 3993374c5 |
15 | 21d1271c8 |
hex | 144955055 |
5445603413 has 2 divisors, whose sum is σ = 5445603414. Its totient is φ = 5445603412.
The previous prime is 5445603403. The next prime is 5445603481. The reversal of 5445603413 is 3143065445.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3290972689 + 2154630724 = 57367^2 + 46418^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5445603413 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5445603403) 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, 2722801706 + 2722801707.
It is an arithmetic number, because the mean of its divisors is an integer number (2722801707).
Almost surely, 25445603413 is an apocalyptic number.
It is an amenable number.
5445603413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5445603413 is an equidigital number, since it uses as much as digits as its factorization.
5445603413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 35.
The square root of 5445603413 is about 73794.3318487267. The cubic root of 5445603413 is about 1759.3355158797.
Adding to 5445603413 its reverse (3143065445), we get a palindrome (8588668858).
The spelling of 5445603413 in words is "five billion, four hundred forty-five million, six hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •