Base | Representation |
---|---|
bin | 101000011000011100011… |
… | …0010101011010010101111 |
3 | 201122120122120021110210000 |
4 | 1100300320302223102233 |
5 | 1211413000420230210 |
6 | 15445354044515343 |
7 | 1111656266223216 |
oct | 120607062532257 |
9 | 21576576243700 |
10 | 5550050555055 |
11 | 184a843937846 |
12 | 75777884bb53 |
13 | 3134a15a2996 |
14 | 1528a3cda07d |
15 | 99582383ac0 |
hex | 50c38cab4af |
5550050555055 has 40 divisors (see below), whose sum is σ = 9980364537792. Its totient is φ = 2950689269952.
The previous prime is 5550050554927. The next prime is 5550050555057. The reversal of 5550050555055 is 5505550500555.
5550050555055 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5550050555055 - 27 = 5550050554927 is a prime.
It is a super-2 number, since 2×55500505550552 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5550050555055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5550050555057) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 21486487 + ... + 21743256.
Almost surely, 25550050555055 is an apocalyptic number.
5550050555055 is a deficient number, since it is larger than the sum of its proper divisors (4430313982737).
5550050555055 is a wasteful number, since it uses less digits than its factorization.
5550050555055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43230077 (or 43230068 counting only the distinct ones).
The product of its (nonzero) digits is 1953125, while the sum is 45.
The spelling of 5550050555055 in words is "five trillion, five hundred fifty billion, fifty million, five hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •