Base | Representation |
---|---|
bin | 1000001110110000101… |
… | …0011100011001011001 |
3 | 111111222111010212002202 |
4 | 2003230022130121121 |
5 | 4304042141123301 |
6 | 144543032335545 |
7 | 13134023432234 |
oct | 2035412343131 |
9 | 444874125082 |
10 | 141401114201 |
11 | 54a71273a66 |
12 | 234a2b445b5 |
13 | 10445c40959 |
14 | 6bb575041b |
15 | 3a28c3666b |
hex | 20ec29c659 |
141401114201 has 4 divisors (see below), whose sum is σ = 141402400932. Its totient is φ = 141399827472.
The previous prime is 141401114191. The next prime is 141401114209. The reversal of 141401114201 is 102411104141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 98768775625 + 42632338576 = 314275^2 + 206476^2 .
It is a cyclic number.
It is not a de Polignac number, because 141401114201 - 210 = 141401113177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141401114209) 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 3 ways as a sum of consecutive naturals, for example, 461366 + ... + 704031.
It is an arithmetic number, because the mean of its divisors is an integer number (35350600233).
Almost surely, 2141401114201 is an apocalyptic number.
It is an amenable number.
141401114201 is a deficient number, since it is larger than the sum of its proper divisors (1286731).
141401114201 is a wasteful number, since it uses less digits than its factorization.
141401114201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286730.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 141401114201 its reverse (102411104141), we get a palindrome (243812218342).
The spelling of 141401114201 in words is "one hundred forty-one billion, four hundred one million, one hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •