Base | Representation |
---|---|
bin | 110011010001110101… |
… | …011011001010101001 |
3 | 12021010020012101010101 |
4 | 303101311123022221 |
5 | 1400230333104401 |
6 | 41143315545401 |
7 | 3656303464603 |
oct | 632165331251 |
9 | 167106171111 |
10 | 55060050601 |
11 | 21394a65a56 |
12 | a8075bb261 |
13 | 52661955ca |
14 | 2944784173 |
15 | 1673c0e101 |
hex | cd1d5b2a9 |
55060050601 has 2 divisors, whose sum is σ = 55060050602. Its totient is φ = 55060050600.
The previous prime is 55060050569. The next prime is 55060050613. The reversal of 55060050601 is 10605006055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28007696025 + 27052354576 = 167355^2 + 164476^2 .
It is a cyclic number.
It is not a de Polignac number, because 55060050601 - 25 = 55060050569 is a prime.
It is a super-2 number, since 2×550600506012 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55060050601.
It is not a weakly prime, because it can be changed into another prime (55060050631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27530025300 + 27530025301.
It is an arithmetic number, because the mean of its divisors is an integer number (27530025301).
Almost surely, 255060050601 is an apocalyptic number.
It is an amenable number.
55060050601 is a deficient number, since it is larger than the sum of its proper divisors (1).
55060050601 is an equidigital number, since it uses as much as digits as its factorization.
55060050601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 55060050601 its reverse (10605006055), we get a palindrome (65665056656).
The spelling of 55060050601 in words is "fifty-five billion, sixty million, fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •