Base | Representation |
---|---|
bin | 100000001100111101111001… |
… | …100011000101011101011101 |
3 | 200120110120010122210110002222 |
4 | 200030331321203011131131 |
5 | 122030420320432414031 |
6 | 1221115135113155125 |
7 | 41555220246304121 |
oct | 4014757143053535 |
9 | 616416118713088 |
10 | 141628585826141 |
11 | 411443894a3a37 |
12 | 13a7469a9bbaa5 |
13 | 6104697a2975b |
14 | 26d8c082a1581 |
15 | 11591404a4e7b |
hex | 80cf798c575d |
141628585826141 has 2 divisors, whose sum is σ = 141628585826142. Its totient is φ = 141628585826140.
The previous prime is 141628585826083. The next prime is 141628585826173.
141628585826141 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., 121177252866916 + 20451332959225 = 11008054^2 + 4522315^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 141628585826141 - 214 = 141628585809757 is a prime.
It is a super-2 number, since 2×1416285858261412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141628585846141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70814292913070 + 70814292913071.
It is an arithmetic number, because the mean of its divisors is an integer number (70814292913071).
Almost surely, 2141628585826141 is an apocalyptic number.
It is an amenable number.
141628585826141 is a deficient number, since it is larger than the sum of its proper divisors (1).
141628585826141 is an equidigital number, since it uses as much as digits as its factorization.
141628585826141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29491200, while the sum is 62.
The spelling of 141628585826141 in words is "one hundred forty-one trillion, six hundred twenty-eight billion, five hundred eighty-five million, eight hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •