Base | Representation |
---|---|
bin | 101111001100001101… |
… | …0110011100000000101 |
3 | 100200120122202002122221 |
4 | 1132120122303200011 |
5 | 3130021400130313 |
6 | 114320002052341 |
7 | 10215222532501 |
oct | 1363032634005 |
9 | 320518662587 |
10 | 101341411333 |
11 | 39a84648308 |
12 | 1778304a0b1 |
13 | 97306b6766 |
14 | 4c95281301 |
15 | 2981da9c8d |
hex | 17986b3805 |
101341411333 has 2 divisors, whose sum is σ = 101341411334. Its totient is φ = 101341411332.
The previous prime is 101341411321. The next prime is 101341411349. The reversal of 101341411333 is 333114143101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84307768164 + 17033643169 = 290358^2 + 130513^2 .
It is a cyclic number.
It is not a de Polignac number, because 101341411333 - 225 = 101307856901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101341411298 and 101341411307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101341411133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50670705666 + 50670705667.
It is an arithmetic number, because the mean of its divisors is an integer number (50670705667).
Almost surely, 2101341411333 is an apocalyptic number.
It is an amenable number.
101341411333 is a deficient number, since it is larger than the sum of its proper divisors (1).
101341411333 is an equidigital number, since it uses as much as digits as its factorization.
101341411333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 101341411333 its reverse (333114143101), we get a palindrome (434455554434).
The spelling of 101341411333 in words is "one hundred one billion, three hundred forty-one million, four hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •