Base | Representation |
---|---|
bin | 100000111010001… |
… | …011101011111011 |
3 | 1102110220202112212 |
4 | 200322023223323 |
5 | 2112320420011 |
6 | 130441525335 |
7 | 16452653300 |
oct | 4072135373 |
9 | 1373822485 |
10 | 552123131 |
11 | 26372830a |
12 | 134aa384b |
13 | 8a5049a1 |
14 | 534830a7 |
15 | 3371208b |
hex | 20e8bafb |
552123131 has 12 divisors (see below), whose sum is σ = 644567400. Its totient is φ = 471552480.
The previous prime is 552123079. The next prime is 552123133. The reversal of 552123131 is 131321255.
It is a happy number.
It is not a de Polignac number, because 552123131 - 222 = 547928827 is a prime.
It is a super-2 number, since 2×5521231312 = 609679903570486322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 552123097 and 552123106.
It is not an unprimeable number, because it can be changed into a prime (552123133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6281 + ... + 33818.
It is an arithmetic number, because the mean of its divisors is an integer number (53713950).
Almost surely, 2552123131 is an apocalyptic number.
552123131 is a deficient number, since it is larger than the sum of its proper divisors (92444269).
552123131 is a wasteful number, since it uses less digits than its factorization.
552123131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40394 (or 40387 counting only the distinct ones).
The product of its digits is 900, while the sum is 23.
The square root of 552123131 is about 23497.3005045260. The cubic root of 552123131 is about 820.3741753569.
Adding to 552123131 its reverse (131321255), we get a palindrome (683444386).
The spelling of 552123131 in words is "five hundred fifty-two million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •