Base | Representation |
---|---|
bin | 10110111101110000111001… |
… | …110101000011110101101001 |
3 | 111020121122022200212112000112 |
4 | 112331300321311003311221 |
5 | 101214301402303042101 |
6 | 554451225021144105 |
7 | 30163053241334432 |
oct | 2675607165036551 |
9 | 436548280775015 |
10 | 101001421143401 |
11 | 2a20050a152149 |
12 | b3b29036bb035 |
13 | 4448515983c2c |
14 | 1ad26cdcb2489 |
15 | ba242aba56bb |
hex | 5bdc39d43d69 |
101001421143401 has 2 divisors, whose sum is σ = 101001421143402. Its totient is φ = 101001421143400.
The previous prime is 101001421143391. The next prime is 101001421143409. The reversal of 101001421143401 is 104341124100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53122217673001 + 47879203470400 = 7288499^2 + 6919480^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101001421143401 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101001421143409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500710571700 + 50500710571701.
It is an arithmetic number, because the mean of its divisors is an integer number (50500710571701).
Almost surely, 2101001421143401 is an apocalyptic number.
It is an amenable number.
101001421143401 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001421143401 is an equidigital number, since it uses as much as digits as its factorization.
101001421143401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 101001421143401 its reverse (104341124100101), we get a palindrome (205342545243502).
The spelling of 101001421143401 in words is "one hundred one trillion, one billion, four hundred twenty-one million, one hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •