Base | Representation |
---|---|
bin | 111110100100000100001011… |
… | …1010101110110010101010110 |
3 | 2200011111120001021101112001010 |
4 | 1331020020113111312111112 |
5 | 1034112323200104140042 |
6 | 5230231003103513050 |
7 | 223625625411124602 |
oct | 17510102725662526 |
9 | 2604446037345033 |
10 | 550314551240022 |
11 | 14a3900aa560158 |
12 | 5187a7918b8786 |
13 | 1a80b5937aa15a |
14 | 99c751b572502 |
15 | 4394e2743a59c |
hex | 1f48217576556 |
550314551240022 has 8 divisors (see below), whose sum is σ = 1100629102480056. Its totient is φ = 183438183746672.
The previous prime is 550314551239991. The next prime is 550314551240029. The reversal of 550314551240022 is 220042155413055.
It is a sphenic number, since it is the product of 3 distinct primes.
550314551240022 is an admirable number.
It is a super-2 number, since 2×5503145512400222 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550314551240029) 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, 45859545936663 + ... + 45859545936674.
It is an arithmetic number, because the mean of its divisors is an integer number (137578637810007).
Almost surely, 2550314551240022 is an apocalyptic number.
550314551240022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550314551240022 is a wasteful number, since it uses less digits than its factorization.
550314551240022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91719091873342.
The product of its (nonzero) digits is 240000, while the sum is 39.
The spelling of 550314551240022 in words is "five hundred fifty trillion, three hundred fourteen billion, five hundred fifty-one million, two hundred forty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •