Base | Representation |
---|---|
bin | 111000110111001010… |
… | …010110001000011001 |
3 | 12211121000202102012112 |
4 | 320313022112020121 |
5 | 2000020040013423 |
6 | 44014232322105 |
7 | 4260666642461 |
oct | 706712261031 |
9 | 184530672175 |
10 | 61055001113 |
11 | 23990a58007 |
12 | b9bb243335 |
13 | 59b01b3bc2 |
14 | 2d52a3aba1 |
15 | 18c519aa78 |
hex | e37296219 |
61055001113 has 2 divisors, whose sum is σ = 61055001114. Its totient is φ = 61055001112.
The previous prime is 61055001107. The next prime is 61055001131. The reversal of 61055001113 is 31110055016.
Together with next prime (61055001131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60933935104 + 121066009 = 246848^2 + 11003^2 .
It is a cyclic number.
It is not a de Polignac number, because 61055001113 - 222 = 61050806809 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (61055001193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30527500556 + 30527500557.
It is an arithmetic number, because the mean of its divisors is an integer number (30527500557).
Almost surely, 261055001113 is an apocalyptic number.
It is an amenable number.
61055001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
61055001113 is an equidigital number, since it uses as much as digits as its factorization.
61055001113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 61055001113 its reverse (31110055016), we get a palindrome (92165056129).
The spelling of 61055001113 in words is "sixty-one billion, fifty-five million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •