Base | Representation |
---|---|
bin | 100000001000101001010101… |
… | …010111110000011010010101 |
3 | 200112102011122000202000111211 |
4 | 200020221111113300122111 |
5 | 122011034132242230031 |
6 | 1220330504104301421 |
7 | 41524605306461323 |
oct | 4010512527603225 |
9 | 615364560660454 |
10 | 141331626133141 |
11 | 4103a451498354 |
12 | 13a27023771871 |
13 | 60b2690a55892 |
14 | 26c86b6c58d13 |
15 | 115155eb9cbb1 |
hex | 808a555f0695 |
141331626133141 has 2 divisors, whose sum is σ = 141331626133142. Its totient is φ = 141331626133140.
The previous prime is 141331626133123. The next prime is 141331626133157.
141331626133141 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115507595522916 + 25824030610225 = 10747446^2 + 5081735^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 141331626133141 - 223 = 141331617744533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141331626133094 and 141331626133103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141331626133241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70665813066570 + 70665813066571.
It is an arithmetic number, because the mean of its divisors is an integer number (70665813066571).
Almost surely, 2141331626133141 is an apocalyptic number.
It is an amenable number.
141331626133141 is a deficient number, since it is larger than the sum of its proper divisors (1).
141331626133141 is an equidigital number, since it uses as much as digits as its factorization.
141331626133141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 93312, while the sum is 40.
The spelling of 141331626133141 in words is "one hundred forty-one trillion, three hundred thirty-one billion, six hundred twenty-six million, one hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •