Base | Representation |
---|---|
bin | 10000000001000100101… |
… | …10100000100111110101 |
3 | 1221121111121000100022122 |
4 | 20000202112200213311 |
5 | 33004040011440041 |
6 | 1100452531405325 |
7 | 54521513002346 |
oct | 10004226404765 |
9 | 1847447010278 |
10 | 550332140021 |
11 | 1a2438167234 |
12 | 8a7a9153845 |
13 | 3cb8595c651 |
14 | 1c8c9ad20cd |
15 | e4ae734c4b |
hex | 80225a09f5 |
550332140021 has 4 divisors (see below), whose sum is σ = 559353978444. Its totient is φ = 541310301600.
The previous prime is 550332140011. The next prime is 550332140081. The reversal of 550332140021 is 120041233055.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 278250975025 + 272081164996 = 527495^2 + 521614^2 .
It is a cyclic number.
It is not a de Polignac number, because 550332140021 - 210 = 550332138997 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 (550332140011) 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, 4510919120 + ... + 4510919241.
It is an arithmetic number, because the mean of its divisors is an integer number (139838494611).
Almost surely, 2550332140021 is an apocalyptic number.
It is an amenable number.
550332140021 is a deficient number, since it is larger than the sum of its proper divisors (9021838423).
550332140021 is an equidigital number, since it uses as much as digits as its factorization.
550332140021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9021838422.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 550332140021 its reverse (120041233055), we get a palindrome (670373373076).
The spelling of 550332140021 in words is "five hundred fifty billion, three hundred thirty-two million, one hundred forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •