Base | Representation |
---|---|
bin | 100000001010001110100101… |
… | …011001110111000000101101 |
3 | 200112210120020200210022200002 |
4 | 200022032211121313000231 |
5 | 122014324310304403031 |
6 | 1220452444021114045 |
7 | 41535504361123451 |
oct | 4012164531670055 |
9 | 615716220708602 |
10 | 141440343044141 |
11 | 41081570340729 |
12 | 13a44104858925 |
13 | 60bc9c8488c0b |
14 | 26cda6b880661 |
15 | 11542c42e5ccb |
hex | 80a3a567702d |
141440343044141 has 2 divisors, whose sum is σ = 141440343044142. Its totient is φ = 141440343044140.
The previous prime is 141440343044107. The next prime is 141440343044153.
141440343044141 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., 102807330966025 + 38633012078116 = 10139395^2 + 6215546^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 141440343044141 - 222 = 141440338849837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141440343044095 and 141440343044104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141440343049141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70720171522070 + 70720171522071.
It is an arithmetic number, because the mean of its divisors is an integer number (70720171522071).
Almost surely, 2141440343044141 is an apocalyptic number.
It is an amenable number.
141440343044141 is a deficient number, since it is larger than the sum of its proper divisors (1).
141440343044141 is an equidigital number, since it uses as much as digits as its factorization.
141440343044141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 147456, while the sum is 38.
The spelling of 141440343044141 in words is "one hundred forty-one trillion, four hundred forty billion, three hundred forty-three million, forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •