Base | Representation |
---|---|
bin | 1011101101010011110… |
… | …1101010011011110001 |
3 | 201020011220002100002122 |
4 | 2323110331222123301 |
5 | 11243414201230001 |
6 | 232223022524025 |
7 | 20350320642161 |
oct | 2732475523361 |
9 | 636156070078 |
10 | 201141430001 |
11 | 78338103486 |
12 | 32b95a36615 |
13 | 15c76947545 |
14 | 9a419265a1 |
15 | 5373790b1b |
hex | 2ed4f6a6f1 |
201141430001 has 8 divisors (see below), whose sum is σ = 201909044904. Its totient is φ = 200374611840.
The previous prime is 201141429997. The next prime is 201141430027. The reversal of 201141430001 is 100034141102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 13409871601 + 187731558400 = 115801^2 + 433280^2 .
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 201141430001 - 22 = 201141429997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201141430801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309155 + ... + 705591.
It is an arithmetic number, because the mean of its divisors is an integer number (25238630613).
Almost surely, 2201141430001 is an apocalyptic number.
It is an amenable number.
201141430001 is a deficient number, since it is larger than the sum of its proper divisors (767614903).
201141430001 is a wasteful number, since it uses less digits than its factorization.
201141430001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398371.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 201141430001 its reverse (100034141102), we get a palindrome (301175571103).
The spelling of 201141430001 in words is "two hundred one billion, one hundred forty-one million, four hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •