Base | Representation |
---|---|
bin | 10000000001000100110… |
… | …01111111100101110101 |
3 | 1221121111122201202002211 |
4 | 20000202121333211311 |
5 | 33004040230201201 |
6 | 1100453003133421 |
7 | 54521523525103 |
oct | 10004231774565 |
9 | 1847448652084 |
10 | 550333053301 |
11 | 1a2438730409 |
12 | 8a7a9514271 |
13 | 3cb85bbc255 |
14 | 1c8c9c8cc73 |
15 | e4ae865651 |
hex | 802267f975 |
550333053301 has 4 divisors (see below), whose sum is σ = 550338321600. Its totient is φ = 550327785004.
The previous prime is 550333053293. The next prime is 550333053349. The reversal of 550333053301 is 103350333055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 550333053301 - 23 = 550333053293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550333053701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2474221 + ... + 2687458.
It is an arithmetic number, because the mean of its divisors is an integer number (137584580400).
Almost surely, 2550333053301 is an apocalyptic number.
It is an amenable number.
550333053301 is a deficient number, since it is larger than the sum of its proper divisors (5268299).
550333053301 is a wasteful number, since it uses less digits than its factorization.
550333053301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5268298.
The product of its (nonzero) digits is 30375, while the sum is 31.
Adding to 550333053301 its reverse (103350333055), we get a palindrome (653683386356).
The spelling of 550333053301 in words is "five hundred fifty billion, three hundred thirty-three million, fifty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •