Base | Representation |
---|---|
bin | 100000110010101… |
… | …001111111101001 |
3 | 1102100012112002102 |
4 | 200302221333221 |
5 | 2111314300441 |
6 | 130331343145 |
7 | 16430125133 |
oct | 4062517751 |
9 | 1370175072 |
10 | 550150121 |
11 | 2625aaa24 |
12 | 1342b1ab5 |
13 | 89c93921 |
14 | 530cc053 |
15 | 3347269b |
hex | 20ca9fe9 |
550150121 has 4 divisors (see below), whose sum is σ = 550220244. Its totient is φ = 550080000.
The previous prime is 550150093. The next prime is 550150129. The reversal of 550150121 is 121051055.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 121051055 = 5 ⋅24210211.
It can be written as a sum of positive squares in 2 ways, for example, as 41422096 + 508728025 = 6436^2 + 22555^2 .
It is a cyclic number.
It is not a de Polignac number, because 550150121 - 26 = 550150057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 550150093 and 550150102.
It is not an unprimeable number, because it can be changed into a prime (550150129) 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, 21560 + ... + 39561.
It is an arithmetic number, because the mean of its divisors is an integer number (137555061).
Almost surely, 2550150121 is an apocalyptic number.
It is an amenable number.
550150121 is a deficient number, since it is larger than the sum of its proper divisors (70123).
550150121 is an equidigital number, since it uses as much as digits as its factorization.
550150121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70122.
The product of its (nonzero) digits is 250, while the sum is 20.
The square root of 550150121 is about 23455.2791712228. The cubic root of 550150121 is about 819.3958076549.
The spelling of 550150121 in words is "five hundred fifty million, one hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •