Base | Representation |
---|---|
bin | 100000000100100000000000… |
… | …111000001110000100001001 |
3 | 200111101221021212121111012021 |
4 | 200010200000320032010021 |
5 | 121441402211112111223 |
6 | 1215551551141444441 |
7 | 41465201502540154 |
oct | 4004400070160411 |
9 | 614357255544167 |
10 | 141046740738313 |
11 | 40a3a65007a693 |
12 | 1399b978110721 |
13 | 609185c42b537 |
14 | 26b89ad250c9b |
15 | 1148e393e065d |
hex | 804800e0e109 |
141046740738313 has 2 divisors, whose sum is σ = 141046740738314. Its totient is φ = 141046740738312.
The previous prime is 141046740738311. The next prime is 141046740738353. The reversal of 141046740738313 is 313837047640141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113370597838969 + 27676142899344 = 10647563^2 + 5260812^2 .
It is an emirp because it is prime and its reverse (313837047640141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141046740738313 - 21 = 141046740738311 is a prime.
Together with 141046740738311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (141046740738311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70523370369156 + 70523370369157.
It is an arithmetic number, because the mean of its divisors is an integer number (70523370369157).
Almost surely, 2141046740738313 is an apocalyptic number.
It is an amenable number.
141046740738313 is a deficient number, since it is larger than the sum of its proper divisors (1).
141046740738313 is an equidigital number, since it uses as much as digits as its factorization.
141046740738313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4064256, while the sum is 52.
The spelling of 141046740738313 in words is "one hundred forty-one trillion, forty-six billion, seven hundred forty million, seven hundred thirty-eight thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •