Base | Representation |
---|---|
bin | 10000000001000100110… |
… | …11110110101110000011 |
3 | 1221121111200122112110001 |
4 | 20000202123312232003 |
5 | 33004040341310001 |
6 | 1100453021420431 |
7 | 54521530626514 |
oct | 10004233665603 |
9 | 1847450575401 |
10 | 550333541251 |
11 | 1a2438a33a7a |
12 | 8a7a970a717 |
13 | 3cb86030390 |
14 | 1c8c9d78a0b |
15 | e4ae910001 |
hex | 80226f6b83 |
550333541251 has 8 divisors (see below), whose sum is σ = 592698096144. Its totient is φ = 507973444320.
The previous prime is 550333541137. The next prime is 550333541281. The reversal of 550333541251 is 152145333055.
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 550333541251 - 237 = 412894587779 is a prime.
It is a super-2 number, since 2×5503335412512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 550333541251.
It is not an unprimeable number, because it can be changed into a prime (550333541281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 855865 + ... + 1353946.
It is an arithmetic number, because the mean of its divisors is an integer number (74087262018).
Almost surely, 2550333541251 is an apocalyptic number.
550333541251 is a deficient number, since it is larger than the sum of its proper divisors (42364554893).
550333541251 is a wasteful number, since it uses less digits than its factorization.
550333541251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228981.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 550333541251 in words is "five hundred fifty billion, three hundred thirty-three million, five hundred forty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •