Base | Representation |
---|---|
bin | 100000001011001000001101… |
… | …001001000001000100000001 |
3 | 200120000110221112000210122021 |
4 | 200023020031021001010001 |
5 | 122021333013012021343 |
6 | 1220541115205041441 |
7 | 41543124515104012 |
oct | 4013101511010401 |
9 | 616013845023567 |
10 | 141502213001473 |
11 | 410a582a314375 |
12 | 13a540b09b6281 |
13 | 60c57a845b41c |
14 | 26d2a5a81b009 |
15 | 1155be5cc00ed |
hex | 80b20d241101 |
141502213001473 has 2 divisors, whose sum is σ = 141502213001474. Its totient is φ = 141502213001472.
The previous prime is 141502213001453. The next prime is 141502213001587. The reversal of 141502213001473 is 374100312205141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141193734955009 + 308478046464 = 11882497^2 + 555408^2 .
It is an emirp because it is prime and its reverse (374100312205141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141502213001473 - 29 = 141502213000961 is a prime.
It is not a weakly prime, because it can be changed into another prime (141502213001453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70751106500736 + 70751106500737.
It is an arithmetic number, because the mean of its divisors is an integer number (70751106500737).
Almost surely, 2141502213001473 is an apocalyptic number.
It is an amenable number.
141502213001473 is a deficient number, since it is larger than the sum of its proper divisors (1).
141502213001473 is an equidigital number, since it uses as much as digits as its factorization.
141502213001473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 34.
The spelling of 141502213001473 in words is "one hundred forty-one trillion, five hundred two billion, two hundred thirteen million, one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •