Base | Representation |
---|---|
bin | 100000110100011… |
… | …000001111100101 |
3 | 1102101001110112121 |
4 | 200310120033211 |
5 | 2111423223301 |
6 | 130345145541 |
7 | 16434015526 |
oct | 4064301745 |
9 | 1371043477 |
10 | 550601701 |
11 | 262889231 |
12 | 13448b2b1 |
13 | 8a0c1330 |
14 | 531a884d |
15 | 335113a1 |
hex | 20d183e5 |
550601701 has 4 divisors (see below), whose sum is σ = 592955692. Its totient is φ = 508247712.
The previous prime is 550601671. The next prime is 550601707. The reversal of 550601701 is 107106055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 314211076 + 236390625 = 17726^2 + 15375^2 .
It is a cyclic number.
It is not a de Polignac number, because 550601701 - 213 = 550593509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550601707) 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 3 ways as a sum of consecutive naturals, for example, 21176976 + ... + 21177001.
It is an arithmetic number, because the mean of its divisors is an integer number (148238923).
Almost surely, 2550601701 is an apocalyptic number.
It is an amenable number.
550601701 is a deficient number, since it is larger than the sum of its proper divisors (42353991).
550601701 is a wasteful number, since it uses less digits than its factorization.
550601701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42353990.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 550601701 is about 23464.9036009100. The cubic root of 550601701 is about 819.6199413649.
Adding to 550601701 its reverse (107106055), we get a palindrome (657707756).
The spelling of 550601701 in words is "five hundred fifty million, six hundred one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •