Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …100110111010000011111101 |
3 | 111020121121020012122202102122 |
4 | 112331300200212322003331 |
5 | 101214300020442043231 |
6 | 554451115023532325 |
7 | 30163036612603661 |
oct | 2675604046720375 |
9 | 436547205582378 |
10 | 101000998002941 |
11 | 2a200312311493 |
12 | b3b2805a5a0a5 |
13 | 44484790cc96a |
14 | 1ad268da068a1 |
15 | ba240397077b |
hex | 5bdc209ba0fd |
101000998002941 has 2 divisors, whose sum is σ = 101000998002942. Its totient is φ = 101000998002940.
The previous prime is 101000998002887. The next prime is 101000998002943. The reversal of 101000998002941 is 149200899000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96401881854916 + 4599116148025 = 9818446^2 + 2144555^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101000998002941 is a prime.
Together with 101000998002943, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000998002892 and 101000998002901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000998002943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500499001470 + 50500499001471.
It is an arithmetic number, because the mean of its divisors is an integer number (50500499001471).
Almost surely, 2101000998002941 is an apocalyptic number.
It is an amenable number.
101000998002941 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000998002941 is an equidigital number, since it uses as much as digits as its factorization.
101000998002941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 44.
The spelling of 101000998002941 in words is "one hundred one trillion, nine hundred ninety-eight million, two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •