Base | Representation |
---|---|
bin | 100000000110101111001010… |
… | …001000001110111100110111 |
3 | 200111221122000111210101100021 |
4 | 200012233022020032330313 |
5 | 122001412000344341043 |
6 | 1220150330452030011 |
7 | 41512252362365341 |
oct | 4006571210167467 |
9 | 614848014711307 |
10 | 141200441012023 |
11 | 40a99852955188 |
12 | 13a05712002307 |
13 | 60a31b5499063 |
14 | 26c21d0214291 |
15 | 114ce32c8c3ed |
hex | 806bca20ef37 |
141200441012023 has 2 divisors, whose sum is σ = 141200441012024. Its totient is φ = 141200441012022.
The previous prime is 141200441011967. The next prime is 141200441012069. The reversal of 141200441012023 is 320210144002141.
It is a strong prime.
It is an emirp because it is prime and its reverse (320210144002141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141200441012023 - 225 = 141200407457591 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141200441019023) 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, 70600220506011 + 70600220506012.
It is an arithmetic number, because the mean of its divisors is an integer number (70600220506012).
Almost surely, 2141200441012023 is an apocalyptic number.
141200441012023 is a deficient number, since it is larger than the sum of its proper divisors (1).
141200441012023 is an equidigital number, since it uses as much as digits as its factorization.
141200441012023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 141200441012023 its reverse (320210144002141), we get a palindrome (461410585014164).
The spelling of 141200441012023 in words is "one hundred forty-one trillion, two hundred billion, four hundred forty-one million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •