Base | Representation |
---|---|
bin | 10111001100011111000111… |
… | …01000000000101011000110 |
3 | 20200121011211120000110121122 |
4 | 23212033203220000223012 |
5 | 23141142411210302200 |
6 | 300252031012113542 |
7 | 13513046665451666 |
oct | 1346174350005306 |
9 | 220534746013548 |
10 | 51006555556550 |
11 | 15285838967710 |
12 | 58794b43058b2 |
13 | 225cb88bc1c59 |
14 | c84a325581a6 |
15 | 5d6be6b9d385 |
hex | 2e63e3a00ac6 |
51006555556550 has 48 divisors (see below), whose sum is σ = 104521660457904. Its totient is φ = 18364196400000.
The previous prime is 51006555556549. The next prime is 51006555556553. The reversal of 51006555556550 is 5565555560015.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51006555556492 and 51006555556501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51006555556553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 459049361 + ... + 459160460.
It is an arithmetic number, because the mean of its divisors is an integer number (2177534592873).
Almost surely, 251006555556550 is an apocalyptic number.
51006555556550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51006555556550 is an abundant number, since it is smaller than the sum of its proper divisors (53515104901354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51006555556550 is a wasteful number, since it uses less digits than its factorization.
51006555556550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918209945 (or 918209940 counting only the distinct ones).
The product of its (nonzero) digits is 14062500, while the sum is 53.
The spelling of 51006555556550 in words is "fifty-one trillion, six billion, five hundred fifty-five million, five hundred fifty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •