Base | Representation |
---|---|
bin | 110011010101100001… |
… | …111011110001001001 |
3 | 12021021112212021110220 |
4 | 303111201323301021 |
5 | 1400342221100441 |
6 | 41153412500253 |
7 | 3660655460325 |
oct | 632541736111 |
9 | 167245767426 |
10 | 55122050121 |
11 | 21416a62126 |
12 | a82431a689 |
13 | 5275c92708 |
14 | 294cac2985 |
15 | 16793a9466 |
hex | cd587bc49 |
55122050121 has 16 divisors (see below), whose sum is σ = 77071935360. Its totient is φ = 34994816640.
The previous prime is 55122050099. The next prime is 55122050131. The reversal of 55122050121 is 12105022155.
It is not a de Polignac number, because 55122050121 - 214 = 55122033737 is a prime.
It is a super-3 number, since 3×551220501213 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 55122050091 and 55122050100.
It is not an unprimeable number, because it can be changed into a prime (55122050131) 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 15 ways as a sum of consecutive naturals, for example, 4333285 + ... + 4345986.
It is an arithmetic number, because the mean of its divisors is an integer number (4816995960).
Almost surely, 255122050121 is an apocalyptic number.
It is an amenable number.
55122050121 is a deficient number, since it is larger than the sum of its proper divisors (21949885239).
55122050121 is a wasteful number, since it uses less digits than its factorization.
55122050121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8679376.
The product of its (nonzero) digits is 1000, while the sum is 24.
Adding to 55122050121 its reverse (12105022155), we get a palindrome (67227072276).
The spelling of 55122050121 in words is "fifty-five billion, one hundred twenty-two million, fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •