Base | Representation |
---|---|
bin | 100000000100100011100010… |
… | …001010111111110011001111 |
3 | 200111102022001021222000102101 |
4 | 200010203202022333303033 |
5 | 121441432431224043343 |
6 | 1215553414203535531 |
7 | 41465364250350256 |
oct | 4004434212776317 |
9 | 614368037860371 |
10 | 141050520534223 |
11 | 40a4120a731263 |
12 | 139a0651b2a5a7 |
13 | 6092012540671 |
14 | 26b8c4b24379d |
15 | 11490ab169e4d |
hex | 8048e22bfccf |
141050520534223 has 2 divisors, whose sum is σ = 141050520534224. Its totient is φ = 141050520534222.
The previous prime is 141050520534221. The next prime is 141050520534251. The reversal of 141050520534223 is 322435025050141.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141050520534223 - 21 = 141050520534221 is a prime.
Together with 141050520534221, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141050520534221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70525260267111 + 70525260267112.
It is an arithmetic number, because the mean of its divisors is an integer number (70525260267112).
Almost surely, 2141050520534223 is an apocalyptic number.
141050520534223 is a deficient number, since it is larger than the sum of its proper divisors (1).
141050520534223 is an equidigital number, since it uses as much as digits as its factorization.
141050520534223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 141050520534223 its reverse (322435025050141), we get a palindrome (463485545584364).
The spelling of 141050520534223 in words is "one hundred forty-one trillion, fifty billion, five hundred twenty million, five hundred thirty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •