Base | Representation |
---|---|
bin | 10111111000110001000001… |
… | …110111001101000011110101 |
3 | 111202222020220121211000010201 |
4 | 113320301001313031003311 |
5 | 102232214144243104423 |
6 | 1011234021253520501 |
7 | 31062021512032351 |
oct | 2770610167150365 |
9 | 452866817730121 |
10 | 105056005050613 |
11 | 30524002057131 |
12 | b948683643131 |
13 | 468097b0c37c6 |
14 | 1bd2a48650461 |
15 | c22b33b6a2ad |
hex | 5f8c41dcd0f5 |
105056005050613 has 2 divisors, whose sum is σ = 105056005050614. Its totient is φ = 105056005050612.
The previous prime is 105056005050533. The next prime is 105056005050629. The reversal of 105056005050613 is 316050500650501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92476264465764 + 12579740584849 = 9616458^2 + 3546793^2 .
It is an emirp because it is prime and its reverse (316050500650501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105056005050613 is a prime.
It is a super-2 number, since 2×1050560050506132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105056005020613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52528002525306 + 52528002525307.
It is an arithmetic number, because the mean of its divisors is an integer number (52528002525307).
Almost surely, 2105056005050613 is an apocalyptic number.
It is an amenable number.
105056005050613 is a deficient number, since it is larger than the sum of its proper divisors (1).
105056005050613 is an equidigital number, since it uses as much as digits as its factorization.
105056005050613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67500, while the sum is 37.
The spelling of 105056005050613 in words is "one hundred five trillion, fifty-six billion, five million, fifty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •