Base | Representation |
---|---|
bin | 100000000100000000010010… |
… | …010010100111011100100001 |
3 | 200111021200100122101210101101 |
4 | 200010000102102213130201 |
5 | 121440322423310213241 |
6 | 1215524154442434401 |
7 | 41462554331631544 |
oct | 4004002222473441 |
9 | 614250318353341 |
10 | 141012673132321 |
11 | 40a27158877011 |
12 | 1399524ab02a01 |
13 | 608b590433ab3 |
14 | 26b709a8d485b |
15 | 11480e3639e31 |
hex | 8040124a7721 |
141012673132321 has 2 divisors, whose sum is σ = 141012673132322. Its totient is φ = 141012673132320.
The previous prime is 141012673132319. The next prime is 141012673132333. The reversal of 141012673132321 is 123231376210141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115357029912721 + 25655643219600 = 10740439^2 + 5065140^2 .
It is an emirp because it is prime and its reverse (123231376210141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141012673132321 - 21 = 141012673132319 is a prime.
Together with 141012673132319, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (141012673132351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70506336566160 + 70506336566161.
It is an arithmetic number, because the mean of its divisors is an integer number (70506336566161).
Almost surely, 2141012673132321 is an apocalyptic number.
It is an amenable number.
141012673132321 is a deficient number, since it is larger than the sum of its proper divisors (1).
141012673132321 is an equidigital number, since it uses as much as digits as its factorization.
141012673132321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 37.
The spelling of 141012673132321 in words is "one hundred forty-one trillion, twelve billion, six hundred seventy-three million, one hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •