Base | Representation |
---|---|
bin | 100000111100001… |
… | …001111001111001 |
3 | 1102111220000201122 |
4 | 200330021321321 |
5 | 2112433440441 |
6 | 130500555025 |
7 | 16460235455 |
oct | 4074117171 |
9 | 1374800648 |
10 | 552640121 |
11 | 263a50780 |
12 | 1350b2a75 |
13 | 8a6560b7 |
14 | 53579665 |
15 | 337b534b |
hex | 20f09e79 |
552640121 has 8 divisors (see below), whose sum is σ = 603105600. Its totient is φ = 502212240.
The previous prime is 552640111. The next prime is 552640129. The reversal of 552640121 is 121046255.
552640121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 552640121 - 226 = 485531257 is a prime.
It is a super-2 number, since 2×5526401212 = 610822206677789282, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (552640129) 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, 27740 + ... + 43298.
It is an arithmetic number, because the mean of its divisors is an integer number (75388200).
Almost surely, 2552640121 is an apocalyptic number.
It is an amenable number.
552640121 is a deficient number, since it is larger than the sum of its proper divisors (50465479).
552640121 is a wasteful number, since it uses less digits than its factorization.
552640121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18799.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 552640121 is about 23508.2989814236. The cubic root of 552640121 is about 820.6301526386.
Adding to 552640121 its reverse (121046255), we get a palindrome (673686376).
The spelling of 552640121 in words is "five hundred fifty-two million, six hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •