Base | Representation |
---|---|
bin | 1000001110011000110… |
… | …0100011011110110011 |
3 | 111111201111202202000100 |
4 | 2003212030203132303 |
5 | 4303341024113321 |
6 | 144525054523443 |
7 | 13131366501333 |
oct | 2034614433663 |
9 | 444644682010 |
10 | 141301004211 |
11 | 54a1a807934 |
12 | 23475506583 |
13 | 1042b28c083 |
14 | 6ba63310c3 |
15 | 3a2005e326 |
hex | 20e63237b3 |
141301004211 has 12 divisors (see below), whose sum is σ = 204365498688. Its totient is φ = 94078801104.
The previous prime is 141301004203. The next prime is 141301004213. The reversal of 141301004211 is 112400103141.
141301004211 is a `hidden beast` number, since 14 + 130 + 100 + 421 + 1 = 666.
141301004211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141301004211 - 23 = 141301004203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141301004213) 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 11 ways as a sum of consecutive naturals, for example, 10148355 + ... + 10162268.
It is an arithmetic number, because the mean of its divisors is an integer number (17030458224).
Almost surely, 2141301004211 is an apocalyptic number.
141301004211 is a deficient number, since it is larger than the sum of its proper divisors (63064494477).
141301004211 is a wasteful number, since it uses less digits than its factorization.
141301004211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20311402 (or 20311399 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 141301004211 its reverse (112400103141), we get a palindrome (253701107352).
The spelling of 141301004211 in words is "one hundred forty-one billion, three hundred one million, four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •