Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …100011001110010111011111 |
3 | 111010102222210011022200221222 |
4 | 112300232200203032113133 |
5 | 101110112024031400234 |
6 | 552523455151443555 |
7 | 30041245343315216 |
oct | 2660564043162737 |
9 | 433388704280858 |
10 | 100105496356319 |
11 | 29995558a48113 |
12 | b2891482265bb |
13 | 43b1ba5591a1c |
14 | 1aa11bbc1c07d |
15 | b88e9130942e |
hex | 5b0ba08ce5df |
100105496356319 has 2 divisors, whose sum is σ = 100105496356320. Its totient is φ = 100105496356318.
The previous prime is 100105496356297. The next prime is 100105496356321. The reversal of 100105496356319 is 913653694501001.
It is a strong prime.
It is an emirp because it is prime and its reverse (913653694501001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100105496356319 - 216 = 100105496290783 is a prime.
It is a super-2 number, since 2×1001054963563192 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 100105496356321, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100105496356339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50052748178159 + 50052748178160.
It is an arithmetic number, because the mean of its divisors is an integer number (50052748178160).
Almost surely, 2100105496356319 is an apocalyptic number.
100105496356319 is a deficient number, since it is larger than the sum of its proper divisors (1).
100105496356319 is an equidigital number, since it uses as much as digits as its factorization.
100105496356319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2624400, while the sum is 53.
The spelling of 100105496356319 in words is "one hundred trillion, one hundred five billion, four hundred ninety-six million, three hundred fifty-six thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •