Base | Representation |
---|---|
bin | 1000001101010011100… |
… | …0000110110011110111 |
3 | 111110222021000002210211 |
4 | 2003110320012303313 |
5 | 4302242132244343 |
6 | 144440154530251 |
7 | 13121240613634 |
oct | 2032470066367 |
9 | 443867002724 |
10 | 141010431223 |
11 | 54890792072 |
12 | 233b4136987 |
13 | 103b30120ac |
14 | 6b798d318b |
15 | 3a047b379d |
hex | 20d4e06cf7 |
141010431223 has 2 divisors, whose sum is σ = 141010431224. Its totient is φ = 141010431222.
The previous prime is 141010431209. The next prime is 141010431257. The reversal of 141010431223 is 322134010141.
141010431223 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 141010431223 - 225 = 140976876791 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141010431194 and 141010431203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141010432223) 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, 70505215611 + 70505215612.
It is an arithmetic number, because the mean of its divisors is an integer number (70505215612).
Almost surely, 2141010431223 is an apocalyptic number.
141010431223 is a deficient number, since it is larger than the sum of its proper divisors (1).
141010431223 is an equidigital number, since it uses as much as digits as its factorization.
141010431223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 141010431223 its reverse (322134010141), we get a palindrome (463144441364).
The spelling of 141010431223 in words is "one hundred forty-one billion, ten million, four hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •