Base | Representation |
---|---|
bin | 1011101110000000111… |
… | …0101100100000001101 |
3 | 201020200001202020222021 |
4 | 2323200032230200031 |
5 | 11244311043204201 |
6 | 232253454050141 |
7 | 20355104353240 |
oct | 2734016544015 |
9 | 636601666867 |
10 | 201330444301 |
11 | 78424872748 |
12 | 330291a9951 |
13 | 15ca6b5641c |
14 | 9a5ca89257 |
15 | 5385179ea1 |
hex | 2ee03ac80d |
201330444301 has 4 divisors (see below), whose sum is σ = 230091936352. Its totient is φ = 172568952252.
The previous prime is 201330444299. The next prime is 201330444349. The reversal of 201330444301 is 103444033102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201330444301 - 21 = 201330444299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201330444391) 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, 14380746015 + ... + 14380746028.
It is an arithmetic number, because the mean of its divisors is an integer number (57522984088).
Almost surely, 2201330444301 is an apocalyptic number.
It is an amenable number.
201330444301 is a deficient number, since it is larger than the sum of its proper divisors (28761492051).
201330444301 is an equidigital number, since it uses as much as digits as its factorization.
201330444301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28761492050.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 201330444301 its reverse (103444033102), we get a palindrome (304774477403).
The spelling of 201330444301 in words is "two hundred one billion, three hundred thirty million, four hundred forty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •