Base | Representation |
---|---|
bin | 10110110000101110000110… |
… | …100110101010011010000101 |
3 | 111010102221122211012211221022 |
4 | 112300232012212222122011 |
5 | 101110110131112044424 |
6 | 552523344041400525 |
7 | 30041231506264442 |
oct | 2660560646523205 |
9 | 433387584184838 |
10 | 100105061049989 |
11 | 29995355258016 |
12 | b289046499145 |
13 | 43b1b3633b108 |
14 | 1aa117a0a69c9 |
15 | b88e67ebe95e |
hex | 5b0b869aa685 |
100105061049989 has 2 divisors, whose sum is σ = 100105061049990. Its totient is φ = 100105061049988.
The previous prime is 100105061049967. The next prime is 100105061050019. The reversal of 100105061049989 is 989940160501001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70223696081764 + 29881364968225 = 8379958^2 + 5466385^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100105061049989 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100105061049989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100105361049989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50052530524994 + 50052530524995.
It is an arithmetic number, because the mean of its divisors is an integer number (50052530524995).
Almost surely, 2100105061049989 is an apocalyptic number.
It is an amenable number.
100105061049989 is a deficient number, since it is larger than the sum of its proper divisors (1).
100105061049989 is an equidigital number, since it uses as much as digits as its factorization.
100105061049989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 699840, while the sum is 53.
The spelling of 100105061049989 in words is "one hundred trillion, one hundred five billion, sixty-one million, forty-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •