Base | Representation |
---|---|
bin | 1010010010101001… |
… | …01000001011100001 |
3 | 112021001110202011001 |
4 | 11021110220023201 |
5 | 42303412032041 |
6 | 2312130152001 |
7 | 253626446566 |
oct | 51124501341 |
9 | 15231422131 |
10 | 5525111521 |
11 | 2385866076 |
12 | 10a2422601 |
13 | 6a0896877 |
14 | 3a5b1286d |
15 | 2250d0131 |
hex | 1495282e1 |
5525111521 has 2 divisors, whose sum is σ = 5525111522. Its totient is φ = 5525111520.
The previous prime is 5525111513. The next prime is 5525111531. The reversal of 5525111521 is 1251115255.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5334257296 + 190854225 = 73036^2 + 13815^2 .
It is a cyclic number.
It is not a de Polignac number, because 5525111521 - 23 = 5525111513 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5525111521.
It is not a weakly prime, because it can be changed into another prime (5525111531) 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, 2762555760 + 2762555761.
It is an arithmetic number, because the mean of its divisors is an integer number (2762555761).
Almost surely, 25525111521 is an apocalyptic number.
It is an amenable number.
5525111521 is a deficient number, since it is larger than the sum of its proper divisors (1).
5525111521 is an equidigital number, since it uses as much as digits as its factorization.
5525111521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2500, while the sum is 28.
The square root of 5525111521 is about 74331.0939042336. The cubic root of 5525111521 is about 1767.8565263455.
Adding to 5525111521 its reverse (1251115255), we get a palindrome (6776226776).
The spelling of 5525111521 in words is "five billion, five hundred twenty-five million, one hundred eleven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •