Base | Representation |
---|---|
bin | 101000110100100110000… |
… | …1010000110011111100101 |
3 | 201212100200201222201200202 |
4 | 1101221030022012133211 |
5 | 1213410303240130104 |
6 | 15533232545320245 |
7 | 1116226354453031 |
oct | 121511412063745 |
9 | 21770621881622 |
10 | 5610505005029 |
11 | 187344689a8a1 |
12 | 76742a936085 |
13 | 3190b7227182 |
14 | 15579ac891c1 |
15 | 9ae1e95351e |
hex | 51a4c2867e5 |
5610505005029 has 2 divisors, whose sum is σ = 5610505005030. Its totient is φ = 5610505005028.
The previous prime is 5610505005019. The next prime is 5610505005073. The reversal of 5610505005029 is 9205005050165.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3056028422500 + 2554476582529 = 1748150^2 + 1598273^2 .
It is a cyclic number.
It is not a de Polignac number, because 5610505005029 - 24 = 5610505005013 is a prime.
It is a super-2 number, since 2×56105050050292 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5610505004983 and 5610505005001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5610505005019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2805252502514 + 2805252502515.
It is an arithmetic number, because the mean of its divisors is an integer number (2805252502515).
Almost surely, 25610505005029 is an apocalyptic number.
It is an amenable number.
5610505005029 is a deficient number, since it is larger than the sum of its proper divisors (1).
5610505005029 is an equidigital number, since it uses as much as digits as its factorization.
5610505005029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 67500, while the sum is 38.
The spelling of 5610505005029 in words is "five trillion, six hundred ten billion, five hundred five million, five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •