Base | Representation |
---|---|
bin | 1000001110011101101… |
… | …0011001011010100011 |
3 | 111111202221011110210010 |
4 | 2003213122121122203 |
5 | 4303411240111321 |
6 | 144531104140003 |
7 | 13132035111132 |
oct | 2034732313243 |
9 | 444687143703 |
10 | 141321410211 |
11 | 54a302851a3 |
12 | 23480307603 |
13 | 10432585227 |
14 | 6ba8d23919 |
15 | 3a21c40676 |
hex | 20e76996a3 |
141321410211 has 8 divisors (see below), whose sum is σ = 188481004560. Its totient is φ = 94188044672.
The previous prime is 141321410207. The next prime is 141321410267. The reversal of 141321410211 is 112014123141.
141321410211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141321410211 - 22 = 141321410207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141321420211) 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 in 7 ways as a sum of consecutive naturals, for example, 6544626 + ... + 6566183.
It is an arithmetic number, because the mean of its divisors is an integer number (23560125570).
Almost surely, 2141321410211 is an apocalyptic number.
141321410211 is a deficient number, since it is larger than the sum of its proper divisors (47159594349).
141321410211 is a wasteful number, since it uses less digits than its factorization.
141321410211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13114405.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 141321410211 its reverse (112014123141), we get a palindrome (253335533352).
The spelling of 141321410211 in words is "one hundred forty-one billion, three hundred twenty-one million, four hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •