Base | Representation |
---|---|
bin | 11000000000111… |
… | …00010001101101 |
3 | 112001001100001010 |
4 | 30000130101231 |
5 | 403032124123 |
6 | 31553335433 |
7 | 4664142444 |
oct | 1400342155 |
9 | 461040033 |
10 | 201442413 |
11 | a3788737 |
12 | 57567579 |
13 | 329709c3 |
14 | 1ca79d5b |
15 | 12a41993 |
hex | c01c46d |
201442413 has 8 divisors (see below), whose sum is σ = 268728928. Its totient is φ = 134225424.
The previous prime is 201442361. The next prime is 201442421. The reversal of 201442413 is 314244102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201442413 - 29 = 201441901 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 201442413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201442463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10195 + ... + 22512.
It is an arithmetic number, because the mean of its divisors is an integer number (33591116).
Almost surely, 2201442413 is an apocalyptic number.
It is an amenable number.
201442413 is a deficient number, since it is larger than the sum of its proper divisors (67286515).
201442413 is a wasteful number, since it uses less digits than its factorization.
201442413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34763.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 201442413 is about 14193.0410060705. The cubic root of 201442413 is about 586.2060617519.
Adding to 201442413 its reverse (314244102), we get a palindrome (515686515).
The spelling of 201442413 in words is "two hundred one million, four hundred forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •