Base | Representation |
---|---|
bin | 111000110100100000… |
… | …000100000010010001 |
3 | 12211110220202112120001 |
4 | 320310200010002101 |
5 | 1444422123100023 |
6 | 44005555450001 |
7 | 4256615345002 |
oct | 706440040221 |
9 | 184426675501 |
10 | 61010362513 |
11 | 23968839401 |
12 | b9a82b6901 |
13 | 59a3b84c29 |
14 | 2d4ab3b1a9 |
15 | 18c12ce6ad |
hex | e34804091 |
61010362513 has 4 divisors (see below), whose sum is σ = 61276783540. Its totient is φ = 60743941488.
The previous prime is 61010362507. The next prime is 61010362531. The reversal of 61010362513 is 31526301016.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 43152583824 + 17857778689 = 207732^2 + 133633^2 .
It is a cyclic number.
It is not a de Polignac number, because 61010362513 - 217 = 61010231441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61010362013) 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 in 3 ways as a sum of consecutive naturals, for example, 133210170 + ... + 133210627.
It is an arithmetic number, because the mean of its divisors is an integer number (15319195885).
Almost surely, 261010362513 is an apocalyptic number.
It is an amenable number.
61010362513 is a deficient number, since it is larger than the sum of its proper divisors (266421027).
61010362513 is a wasteful number, since it uses less digits than its factorization.
61010362513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266421026.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 61010362513 its reverse (31526301016), we get a palindrome (92536663529).
The spelling of 61010362513 in words is "sixty-one billion, ten million, three hundred sixty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •