Base | Representation |
---|---|
bin | 1000001110110101011… |
… | …1000100011010010001 |
3 | 111112000212221101001210 |
4 | 2003231113010122101 |
5 | 4304112311413131 |
6 | 144545031050333 |
7 | 13134356242401 |
oct | 2035527043221 |
9 | 445025841053 |
10 | 141421201041 |
11 | 54a8164355a |
12 | 234a98109a9 |
13 | 1044a154763 |
14 | 6bb829c801 |
15 | 3a2a8a3146 |
hex | 20ed5c4691 |
141421201041 has 16 divisors (see below), whose sum is σ = 189730634240. Its totient is φ = 93697274880.
The previous prime is 141421201021. The next prime is 141421201069. The reversal of 141421201041 is 140102124141.
It is a de Polignac number, because none of the positive numbers 2k-141421201041 is a prime.
It is a super-2 number, since 2×1414212010412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141421200999 and 141421201017.
It is not an unprimeable number, because it can be changed into a prime (141421201021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 450555 + ... + 697023.
It is an arithmetic number, because the mean of its divisors is an integer number (11858164640).
Almost surely, 2141421201041 is an apocalyptic number.
It is an amenable number.
141421201041 is a deficient number, since it is larger than the sum of its proper divisors (48309433199).
141421201041 is a wasteful number, since it uses less digits than its factorization.
141421201041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247656.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 141421201041 its reverse (140102124141), we get a palindrome (281523325182).
The spelling of 141421201041 in words is "one hundred forty-one billion, four hundred twenty-one million, two hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •