Base | Representation |
---|---|
bin | 111110100100011011101101… |
… | …1000111111011101011101010 |
3 | 2200011200101110202020021002120 |
4 | 1331020313123013323223222 |
5 | 1034114140141111112011 |
6 | 5230310121054412110 |
7 | 223632364521246342 |
oct | 17510673307735352 |
9 | 2604611422207076 |
10 | 550365080566506 |
11 | 14a3aa579aa0007 |
12 | 51888533b01036 |
13 | 1a8132870cc4ca |
14 | 99c9b522cdd22 |
15 | 43963d34dca06 |
hex | 1f48ddb1fbaea |
550365080566506 has 8 divisors (see below), whose sum is σ = 1100730161133024. Its totient is φ = 183455026855500.
The previous prime is 550365080566459. The next prime is 550365080566517. The reversal of 550365080566506 is 605665080563055.
It is a sphenic number, since it is the product of 3 distinct primes.
550365080566506 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 550365080566506.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45863756713870 + ... + 45863756713881.
It is an arithmetic number, because the mean of its divisors is an integer number (137591270141628).
Almost surely, 2550365080566506 is an apocalyptic number.
550365080566506 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.
550365080566506 is a wasteful number, since it uses less digits than its factorization.
550365080566506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91727513427756.
The product of its (nonzero) digits is 97200000, while the sum is 60.
The spelling of 550365080566506 in words is "five hundred fifty trillion, three hundred sixty-five billion, eighty million, five hundred sixty-six thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •