Base | Representation |
---|---|
bin | 101110001100110… |
… | …0101110001101001 |
3 | 11000000222221100201 |
4 | 1130121211301221 |
5 | 11133323242301 |
6 | 413454232201 |
7 | 53262405046 |
oct | 13431456151 |
9 | 4000887321 |
10 | 1550212201 |
11 | 72606640a |
12 | 3731b5661 |
13 | 1b9223135 |
14 | 109c541cd |
15 | 91167201 |
hex | 5c665c69 |
1550212201 has 4 divisors (see below), whose sum is σ = 1641401172. Its totient is φ = 1459023232.
The previous prime is 1550212177. The next prime is 1550212207. The reversal of 1550212201 is 1022120551.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1022120551 = 5413 ⋅188827.
It can be written as a sum of positive squares in 2 ways, for example, as 1446661225 + 103550976 = 38035^2 + 10176^2 .
It is not a de Polignac number, because 1550212201 - 217 = 1550081129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1550212207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45594460 + ... + 45594493.
It is an arithmetic number, because the mean of its divisors is an integer number (410350293).
Almost surely, 21550212201 is an apocalyptic number.
It is an amenable number.
1550212201 is a deficient number, since it is larger than the sum of its proper divisors (91188971).
1550212201 is an equidigital number, since it uses as much as digits as its factorization.
1550212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91188970.
The product of its (nonzero) digits is 200, while the sum is 19.
The square root of 1550212201 is about 39372.7342332229. The cubic root of 1550212201 is about 1157.3473375532.
Adding to 1550212201 its reverse (1022120551), we get a palindrome (2572332752).
The spelling of 1550212201 in words is "one billion, five hundred fifty million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •