Base | Representation |
---|---|
bin | 111110100101011000000100… |
… | …0000010011000111101111111 |
3 | 2200012010202222222021111001022 |
4 | 1331022300020002120331333 |
5 | 1034123301102333412244 |
6 | 5230445433254534355 |
7 | 223644633300543245 |
oct | 17512601002307577 |
9 | 2605122888244038 |
10 | 550494683107199 |
11 | 14a44a53627a076 |
12 | 518a96836673bb |
13 | 1a82256c841ccc |
14 | 99d2128a96795 |
15 | 439996b4e06ee |
hex | 1f4ac08098f7f |
550494683107199 has 8 divisors (see below), whose sum is σ = 558138117230400. Its totient is φ = 542854016850816.
The previous prime is 550494683107093. The next prime is 550494683107267. The reversal of 550494683107199 is 991701386494055.
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 550494683107199 - 228 = 550494414671743 is a prime.
It is a super-2 number, since 2×5504946831071992 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550494683100199) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 691566167 + ... + 692361720.
It is an arithmetic number, because the mean of its divisors is an integer number (69767264653800).
Almost surely, 2550494683107199 is an apocalyptic number.
550494683107199 is a deficient number, since it is larger than the sum of its proper divisors (7643434123201).
550494683107199 is a wasteful number, since it uses less digits than its factorization.
550494683107199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1383933409.
The product of its (nonzero) digits is 293932800, while the sum is 71.
The spelling of 550494683107199 in words is "five hundred fifty trillion, four hundred ninety-four billion, six hundred eighty-three million, one hundred seven thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •