Base | Representation |
---|---|
bin | 10000000000110111100… |
… | …11001001000001101011 |
3 | 1221121012221011001212111 |
4 | 20000123303021001223 |
5 | 33003323341030120 |
6 | 1100434003223151 |
7 | 54516006401236 |
oct | 10003363110153 |
9 | 1847187131774 |
10 | 550222205035 |
11 | 1a23910aa478 |
12 | 8a778377ab7 |
13 | 3cb68c4aa69 |
14 | 1c8b927641d |
15 | e4a4c6b75a |
hex | 801bcc906b |
550222205035 has 4 divisors (see below), whose sum is σ = 660266646048. Its totient is φ = 440177764024.
The previous prime is 550222205023. The next prime is 550222205047. The reversal of 550222205035 is 530502222055.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (550222205023) and next prime (550222205047).
It is a cyclic number.
It is not a de Polignac number, because 550222205035 - 217 = 550222073963 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 550222204988 and 550222205006.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55022220499 + ... + 55022220508.
It is an arithmetic number, because the mean of its divisors is an integer number (165066661512).
Almost surely, 2550222205035 is an apocalyptic number.
550222205035 is a deficient number, since it is larger than the sum of its proper divisors (110044441013).
550222205035 is a wasteful number, since it uses less digits than its factorization.
550222205035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110044441012.
The product of its (nonzero) digits is 30000, while the sum is 31.
The spelling of 550222205035 in words is "five hundred fifty billion, two hundred twenty-two million, two hundred five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •