Base | Representation |
---|---|
bin | 1000001101010100001… |
… | …0110100110101111011 |
3 | 111110222110021212101110 |
4 | 2003111002310311323 |
5 | 4302243342204321 |
6 | 144440335051403 |
7 | 13121303526213 |
oct | 2032502646573 |
9 | 443873255343 |
10 | 141013241211 |
11 | 54892331277 |
12 | 233b5070b63 |
13 | 103b37870cb |
14 | 6b7a025243 |
15 | 3a04b6b176 |
hex | 20d50b4d7b |
141013241211 has 16 divisors (see below), whose sum is σ = 195519375360. Its totient is φ = 90291912480.
The previous prime is 141013241183. The next prime is 141013241311. The reversal of 141013241211 is 112142310141.
141013241211 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 141013241211 - 218 = 141012979067 is a prime.
It is a super-3 number, since 3×1410132412113 (a number of 34 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (141013241311) 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 15 ways as a sum of consecutive naturals, for example, 4226425 + ... + 4259658.
It is an arithmetic number, because the mean of its divisors is an integer number (12219960960).
Almost surely, 2141013241211 is an apocalyptic number.
141013241211 is a deficient number, since it is larger than the sum of its proper divisors (54506134149).
141013241211 is a wasteful number, since it uses less digits than its factorization.
141013241211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8486306.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 141013241211 its reverse (112142310141), we get a palindrome (253155551352).
The spelling of 141013241211 in words is "one hundred forty-one billion, thirteen million, two hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •