Base | Representation |
---|---|
bin | 100000110011010… |
… | …011110000111101 |
3 | 1102100112012210011 |
4 | 200303103300331 |
5 | 2111340234323 |
6 | 130335143221 |
7 | 16431440011 |
oct | 4063236075 |
9 | 1370465704 |
10 | 550321213 |
11 | 262707522 |
12 | 134374b11 |
13 | 8a023770 |
14 | 53134541 |
15 | 334a820d |
hex | 20cd3c3d |
550321213 has 8 divisors (see below), whose sum is σ = 601001856. Its totient is φ = 500833200.
The previous prime is 550321169. The next prime is 550321217. The reversal of 550321213 is 312123055.
550321213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 550321213 - 213 = 550313021 is a prime.
It is a super-6 number, since 6×5503212136 (a number of 54 digits) contains 666666 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550321217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 297193 + ... + 299038.
It is an arithmetic number, because the mean of its divisors is an integer number (75125232).
Almost surely, 2550321213 is an apocalyptic number.
It is an amenable number.
550321213 is a deficient number, since it is larger than the sum of its proper divisors (50680643).
550321213 is a wasteful number, since it uses less digits than its factorization.
550321213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596315.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 550321213 is about 23458.9260836893. The cubic root of 550321213 is about 819.4807405559.
Adding to 550321213 its reverse (312123055), we get a palindrome (862444268).
The spelling of 550321213 in words is "five hundred fifty million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •