Base | Representation |
---|---|
bin | 11000000100110… |
… | …00000000010001 |
3 | 112002000002020001 |
4 | 30002120000101 |
5 | 403144333301 |
6 | 32012250001 |
7 | 5001353116 |
oct | 1402300021 |
9 | 462002201 |
10 | 201949201 |
11 | a3aa4473 |
12 | 57770901 |
13 | 32aba58c |
14 | 1cb6c90d |
15 | 12ae1c01 |
hex | c098011 |
201949201 has 8 divisors (see below), whose sum is σ = 205027200. Its totient is φ = 198884400.
The previous prime is 201949183. The next prime is 201949211. The reversal of 201949201 is 102949102.
It is a happy number.
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 201949201 - 27 = 201949073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201949201.
It is not an unprimeable number, because it can be changed into a prime (201949211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30051 + ... + 36151.
It is an arithmetic number, because the mean of its divisors is an integer number (25628400).
Almost surely, 2201949201 is an apocalyptic number.
It is an amenable number.
201949201 is a deficient number, since it is larger than the sum of its proper divisors (3077999).
201949201 is an equidigital number, since it uses as much as digits as its factorization.
201949201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6599.
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 201949201 is about 14210.8831885988. The cubic root of 201949201 is about 586.6972416845.
Subtracting from 201949201 its reverse (102949102), we obtain a palindrome (99000099).
The spelling of 201949201 in words is "two hundred one million, nine hundred forty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •