Base | Representation |
---|---|
bin | 10111111000000001100101… |
… | …010101011001010100000001 |
3 | 111202210101102012202202010211 |
4 | 113320001211111121110001 |
5 | 102230400331000411004 |
6 | 1011154354152354121 |
7 | 31055236201021132 |
oct | 2770014525312401 |
9 | 452711365682124 |
10 | 105005060560129 |
11 | 3050443a234434 |
12 | b93a8263a5941 |
13 | 4678c1c780992 |
14 | 1bd03b4701c89 |
15 | c2165140b504 |
hex | 5f8065559501 |
105005060560129 has 2 divisors, whose sum is σ = 105005060560130. Its totient is φ = 105005060560128.
The previous prime is 105005060560093. The next prime is 105005060560171. The reversal of 105005060560129 is 921065060500501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92720491205904 + 12284569354225 = 9629148^2 + 3504935^2 .
It is a cyclic number.
It is not a de Polignac number, because 105005060560129 - 223 = 105005052171521 is a prime.
It is a super-2 number, since 2×1050050605601292 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105005060560091 and 105005060560100.
It is not a weakly prime, because it can be changed into another prime (105005060530129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52502530280064 + 52502530280065.
It is an arithmetic number, because the mean of its divisors is an integer number (52502530280065).
Almost surely, 2105005060560129 is an apocalyptic number.
It is an amenable number.
105005060560129 is a deficient number, since it is larger than the sum of its proper divisors (1).
105005060560129 is an equidigital number, since it uses as much as digits as its factorization.
105005060560129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 40.
The spelling of 105005060560129 in words is "one hundred five trillion, five billion, sixty million, five hundred sixty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •