Base | Representation |
---|---|
bin | 100000110010010… |
… | …101011101100001 |
3 | 1102100001020201110 |
4 | 200302111131201 |
5 | 2111304103032 |
6 | 130325453533 |
7 | 16426325004 |
oct | 4062253541 |
9 | 1370036643 |
10 | 550066017 |
11 | 262552816 |
12 | 1342712a9 |
13 | 89c64567 |
14 | 530a953b |
15 | 334577cc |
hex | 20c95761 |
550066017 has 8 divisors (see below), whose sum is σ = 772022560. Its totient is φ = 347410080.
The previous prime is 550066009. The next prime is 550066021. The reversal of 550066017 is 710660055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 550066017 - 23 = 550066009 is a prime.
It is a Duffinian number.
It is a plaindrome in base 15.
It is not an unprimeable number, because it can be changed into a prime (550066037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4825084 + ... + 4825197.
It is an arithmetic number, because the mean of its divisors is an integer number (96502820).
Almost surely, 2550066017 is an apocalyptic number.
550066017 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
550066017 is a deficient number, since it is larger than the sum of its proper divisors (221956543).
550066017 is a wasteful number, since it uses less digits than its factorization.
550066017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9650303.
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 550066017 is about 23453.4862440534. The cubic root of 550066017 is about 819.3540505815.
It can be divided in two parts, 5500 and 66017, that added together give a palindrome (71517).
The spelling of 550066017 in words is "five hundred fifty million, sixty-six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •