Base | Representation |
---|---|
bin | 10000000100100110001… |
… | …00101110111000001111 |
3 | 1221210101101120111021120 |
4 | 20002103010232320033 |
5 | 33021423131231411 |
6 | 1101404325532023 |
7 | 54616415434503 |
oct | 10022304567017 |
9 | 1853341514246 |
10 | 552223305231 |
11 | 1a3218728694 |
12 | 8b036574013 |
13 | 400c76bbb10 |
14 | 1ca28d3a303 |
15 | e57079a106 |
hex | 809312ee0f |
552223305231 has 32 divisors (see below), whose sum is σ = 820530648000. Its totient is φ = 328010661888.
The previous prime is 552223305211. The next prime is 552223305241. The reversal of 552223305231 is 132503322255.
It is not a de Polignac number, because 552223305231 - 226 = 552156196367 is a prime.
It is a super-2 number, since 2×5522233052312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 552223305192 and 552223305201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552223305211) 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 31 ways as a sum of consecutive naturals, for example, 3691765 + ... + 3838433.
It is an arithmetic number, because the mean of its divisors is an integer number (25641582750).
Almost surely, 2552223305231 is an apocalyptic number.
552223305231 is a deficient number, since it is larger than the sum of its proper divisors (268307342769).
552223305231 is a wasteful number, since it uses less digits than its factorization.
552223305231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150043.
The product of its (nonzero) digits is 54000, while the sum is 33.
Adding to 552223305231 its reverse (132503322255), we get a palindrome (684726627486).
The spelling of 552223305231 in words is "five hundred fifty-two billion, two hundred twenty-three million, three hundred five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •