Base | Representation |
---|---|
bin | 1000001110001010110… |
… | …0101100010101011111 |
3 | 111111120102100021201022 |
4 | 2003202230230111133 |
5 | 4303231013221343 |
6 | 144515201034355 |
7 | 13130054625104 |
oct | 2034254542537 |
9 | 444512307638 |
10 | 141242320223 |
11 | 5499a675774 |
12 | 234599259bb |
13 | 1041c083114 |
14 | 6b9c616aab |
15 | 3a19d1b568 |
hex | 20e2b2c55f |
141242320223 has 2 divisors, whose sum is σ = 141242320224. Its totient is φ = 141242320222.
The previous prime is 141242320211. The next prime is 141242320283. The reversal of 141242320223 is 322023242141.
141242320223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141242320223 - 24 = 141242320207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141242320192 and 141242320201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141242320283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70621160111 + 70621160112.
It is an arithmetic number, because the mean of its divisors is an integer number (70621160112).
Almost surely, 2141242320223 is an apocalyptic number.
141242320223 is a deficient number, since it is larger than the sum of its proper divisors (1).
141242320223 is an equidigital number, since it uses as much as digits as its factorization.
141242320223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 141242320223 its reverse (322023242141), we get a palindrome (463265562364).
The spelling of 141242320223 in words is "one hundred forty-one billion, two hundred forty-two million, three hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •