Base | Representation |
---|---|
bin | 1101010000101… |
… | …1011011001010 |
3 | 10212122212002222 |
4 | 3110023123022 |
5 | 103214340242 |
6 | 5304054042 |
7 | 1243526201 |
oct | 324133312 |
9 | 125585088 |
10 | 55621322 |
11 | 29440139 |
12 | 16764322 |
13 | b6a5c33 |
14 | 755c238 |
15 | 4d3a5d2 |
hex | 350b6ca |
55621322 has 8 divisors (see below), whose sum is σ = 87823200. Its totient is φ = 26346924.
The previous prime is 55621277. The next prime is 55621367. The reversal of 55621322 is 22312655.
55621322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (55621277) and next prime (55621367).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×556213222 = 6187462922055368, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55621291 and 55621300.
It is an unprimeable number.
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, 731822 + ... + 731897.
It is an arithmetic number, because the mean of its divisors is an integer number (10977900).
Almost surely, 255621322 is an apocalyptic number.
55621322 is a deficient number, since it is larger than the sum of its proper divisors (32201878).
55621322 is a wasteful number, since it uses less digits than its factorization.
55621322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1463740.
The product of its digits is 3600, while the sum is 26.
The square root of 55621322 is about 7457.9703673319. The cubic root of 55621322 is about 381.7219223810.
Adding to 55621322 its reverse (22312655), we get a palindrome (77933977).
The spelling of 55621322 in words is "fifty-five million, six hundred twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •