Base | Representation |
---|---|
bin | 10111111000110001000001… |
… | …111010110110010110111001 |
3 | 111202222020220200121112221212 |
4 | 113320301001322312112321 |
5 | 102232214200014144301 |
6 | 1011234021330212505 |
7 | 31062021523122335 |
oct | 2770610172662671 |
9 | 452866820545855 |
10 | 105056006006201 |
11 | 3052400264a078 |
12 | b948683a24135 |
13 | 468097b369743 |
14 | 1bd2a4881c7c5 |
15 | c22b33ca84bb |
hex | 5f8c41eb65b9 |
105056006006201 has 2 divisors, whose sum is σ = 105056006006202. Its totient is φ = 105056006006200.
The previous prime is 105056006006047. The next prime is 105056006006207. The reversal of 105056006006201 is 102600600650501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104698407986176 + 357598020025 = 10232224^2 + 597995^2 .
It is a cyclic number.
It is not a de Polignac number, because 105056006006201 - 214 = 105056005989817 is a prime.
It is a super-2 number, since 2×1050560060062012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105056006006207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52528003003100 + 52528003003101.
It is an arithmetic number, because the mean of its divisors is an integer number (52528003003101).
Almost surely, 2105056006006201 is an apocalyptic number.
It is an amenable number.
105056006006201 is a deficient number, since it is larger than the sum of its proper divisors (1).
105056006006201 is an equidigital number, since it uses as much as digits as its factorization.
105056006006201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 105056006006201 its reverse (102600600650501), we get a palindrome (207656606656702).
The spelling of 105056006006201 in words is "one hundred five trillion, fifty-six billion, six million, six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •