Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …11000111100001101101 |
3 | 10112121022121220120100211 |
4 | 32203113333013201231 |
5 | 112341103322410023 |
6 | 2043230332022421 |
7 | 132152215153213 |
oct | 16432777074155 |
9 | 3477277816324 |
10 | 1000056060013 |
11 | 35613763568a |
12 | 141998901a11 |
13 | 733c6a9634a |
14 | 3658da7acb3 |
15 | 1b03163ba0d |
hex | e8d7fc786d |
1000056060013 has 2 divisors, whose sum is σ = 1000056060014. Its totient is φ = 1000056060012.
The previous prime is 1000056060001. The next prime is 1000056060079. The reversal of 1000056060013 is 3100606500001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999814008649 + 242051364 = 999907^2 + 15558^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000056060013 - 213 = 1000056051821 is a prime.
It is a super-2 number, since 2×10000560600132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000056060313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500028030006 + 500028030007.
It is an arithmetic number, because the mean of its divisors is an integer number (500028030007).
Almost surely, 21000056060013 is an apocalyptic number.
It is an amenable number.
1000056060013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000056060013 is an equidigital number, since it uses as much as digits as its factorization.
1000056060013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
The spelling of 1000056060013 in words is "one trillion, fifty-six million, sixty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •