Base | Representation |
---|---|
bin | 10000000010101101011… |
… | …11111111001101001001 |
3 | 1221200202212011221201101 |
4 | 20001112233333031021 |
5 | 33012340033442441 |
6 | 1101120053421401 |
7 | 54552346120042 |
oct | 10012657771511 |
9 | 1850685157641 |
10 | 551211234121 |
11 | 1a284940a689 |
12 | 8a9b363a861 |
13 | 3cc95b16482 |
14 | 1c9707698c9 |
15 | e5119d2231 |
hex | 8056bff349 |
551211234121 has 4 divisors (see below), whose sum is σ = 551212854912. Its totient is φ = 551209613332.
The previous prime is 551211234073. The next prime is 551211234137. The reversal of 551211234121 is 121432112155.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 551211234121 - 29 = 551211233609 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 551211234121.
It is not an unprimeable number, because it can be changed into a prime (551211234221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82081 + ... + 1053166.
It is an arithmetic number, because the mean of its divisors is an integer number (137803213728).
Almost surely, 2551211234121 is an apocalyptic number.
It is an amenable number.
551211234121 is a deficient number, since it is larger than the sum of its proper divisors (1620791).
551211234121 is a wasteful number, since it uses less digits than its factorization.
551211234121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1620790.
The product of its digits is 2400, while the sum is 28.
Adding to 551211234121 its reverse (121432112155), we get a palindrome (672643346276).
The spelling of 551211234121 in words is "five hundred fifty-one billion, two hundred eleven million, two hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •