Base | Representation |
---|---|
bin | 10111111000101011011111… |
… | …100000110111011101100001 |
3 | 111202221200120022021012212012 |
4 | 113320223133200313131201 |
5 | 102232120010333414023 |
6 | 1011231155324042305 |
7 | 31061421263325611 |
oct | 2770533740673541 |
9 | 452850508235765 |
10 | 105050060060513 |
11 | 30521531289077 |
12 | b9474a4693395 |
13 | 4680241548599 |
14 | 1bd2642c80a41 |
15 | c228d6c9b978 |
hex | 5f8adf837761 |
105050060060513 has 2 divisors, whose sum is σ = 105050060060514. Its totient is φ = 105050060060512.
The previous prime is 105050060060489. The next prime is 105050060060597. The reversal of 105050060060513 is 315060060050501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102852618490384 + 2197441570129 = 10141628^2 + 1482377^2 .
It is a cyclic number.
It is not a de Polignac number, because 105050060060513 - 222 = 105050055866209 is a prime.
It is a super-2 number, since 2×1050500600605132 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105050060060513.
It is not a weakly prime, because it can be changed into another prime (105050060060213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52525030030256 + 52525030030257.
It is an arithmetic number, because the mean of its divisors is an integer number (52525030030257).
Almost surely, 2105050060060513 is an apocalyptic number.
It is an amenable number.
105050060060513 is a deficient number, since it is larger than the sum of its proper divisors (1).
105050060060513 is an equidigital number, since it uses as much as digits as its factorization.
105050060060513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 105050060060513 in words is "one hundred five trillion, fifty billion, sixty million, sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •