Base | Representation |
---|---|
bin | 10000000001011111001… |
… | …10111100011110010100 |
3 | 1221122002002112001111012 |
4 | 20000233212330132110 |
5 | 33010013431132322 |
6 | 1100530554431352 |
7 | 54530153323400 |
oct | 10005746743624 |
9 | 1848062461435 |
10 | 550554552212 |
11 | 1a2541767865 |
12 | 8a84b732558 |
13 | 3cbbca62cb2 |
14 | 1c90b46a100 |
15 | e4c4019ae2 |
hex | 802f9bc794 |
550554552212 has 36 divisors (see below), whose sum is σ = 1169500983840. Its totient is φ = 225693168624.
The previous prime is 550554552211. The next prime is 550554552217. The reversal of 550554552212 is 212255455055.
It is a super-2 number, since 2×5505545522122 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 550554552212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550554552211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61059662 + ... + 61068677.
It is an arithmetic number, because the mean of its divisors is an integer number (32486138440).
Almost surely, 2550554552212 is an apocalyptic number.
It is an amenable number.
550554552212 is an abundant number, since it is smaller than the sum of its proper divisors (618946431628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550554552212 is a wasteful number, since it uses less digits than its factorization.
550554552212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122128380 (or 122128371 counting only the distinct ones).
The product of its (nonzero) digits is 500000, while the sum is 41.
The spelling of 550554552212 in words is "five hundred fifty billion, five hundred fifty-four million, five hundred fifty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •