Base | Representation |
---|---|
bin | 1010001000110000… |
… | …00101000100011001 |
3 | 112001021022212011211 |
4 | 11010120011010121 |
5 | 42121141131301 |
6 | 2300003423121 |
7 | 251601225544 |
oct | 50430050431 |
9 | 15037285154 |
10 | 5442130201 |
11 | 2342a38a72 |
12 | 107a684aa1 |
13 | 6896314b1 |
14 | 398ab185b |
15 | 21cb8d051 |
hex | 144605119 |
5442130201 has 2 divisors, whose sum is σ = 5442130202. Its totient is φ = 5442130200.
The previous prime is 5442130193. The next prime is 5442130207. The reversal of 5442130201 is 1020312445.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5038160400 + 403969801 = 70980^2 + 20099^2 .
It is a cyclic number.
It is not a de Polignac number, because 5442130201 - 23 = 5442130193 is a prime.
It is a super-2 number, since 2×54421302012 = 59233562249272600802, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5442130207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2721065100 + 2721065101.
It is an arithmetic number, because the mean of its divisors is an integer number (2721065101).
Almost surely, 25442130201 is an apocalyptic number.
It is an amenable number.
5442130201 is a deficient number, since it is larger than the sum of its proper divisors (1).
5442130201 is an equidigital number, since it uses as much as digits as its factorization.
5442130201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 5442130201 is about 73770.7950411272. The cubic root of 5442130201 is about 1758.9614009392.
Adding to 5442130201 its reverse (1020312445), we get a palindrome (6462442646).
The spelling of 5442130201 in words is "five billion, four hundred forty-two million, one hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •