Base | Representation |
---|---|
bin | 1010010000010001… |
… | …11000010011110001 |
3 | 112012200002220122001 |
4 | 11020020320103301 |
5 | 42233321122031 |
6 | 2310140414001 |
7 | 253265615035 |
oct | 51010702361 |
9 | 15180086561 |
10 | 5505254641 |
11 | 2375633327 |
12 | 1097847301 |
13 | 699733633 |
14 | 3a32241c5 |
15 | 2234ab861 |
hex | 1482384f1 |
5505254641 has 2 divisors, whose sum is σ = 5505254642. Its totient is φ = 5505254640.
The previous prime is 5505254603. The next prime is 5505254647. The reversal of 5505254641 is 1464525055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4750104241 + 755150400 = 68921^2 + 27480^2 .
It is a cyclic number.
It is not a de Polignac number, because 5505254641 - 211 = 5505252593 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5505254641.
It is not a weakly prime, because it can be changed into another prime (5505254647) 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, 2752627320 + 2752627321.
It is an arithmetic number, because the mean of its divisors is an integer number (2752627321).
Almost surely, 25505254641 is an apocalyptic number.
It is an amenable number.
5505254641 is a deficient number, since it is larger than the sum of its proper divisors (1).
5505254641 is an equidigital number, since it uses as much as digits as its factorization.
5505254641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120000, while the sum is 37.
The square root of 5505254641 is about 74197.4031957992. The cubic root of 5505254641 is about 1765.7361315577.
Adding to 5505254641 its reverse (1464525055), we get a palindrome (6969779696).
The spelling of 5505254641 in words is "five billion, five hundred five million, two hundred fifty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •