Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …00110000100101111110011 |
3 | 20120020021000012121200201100 |
4 | 23120121310212010233303 |
5 | 23030102133240134210 |
6 | 254243103114135443 |
7 | 13354251035243550 |
oct | 1330316446045763 |
9 | 216207005550640 |
10 | 50055505005555 |
11 | 14a494696a4305 |
12 | 5745113421583 |
13 | 21c12a1b39b2a |
14 | c509b10d5a27 |
15 | 5bc0d29625c0 |
hex | 2d8674984bf3 |
50055505005555 has 48 divisors (see below), whose sum is σ = 104990370174144. Its totient is φ = 21536486184960.
The previous prime is 50055505005511. The next prime is 50055505005577. The reversal of 50055505005555 is 55550050555005.
It is not a de Polignac number, because 50055505005555 - 218 = 50055504743411 is a prime.
It is a super-2 number, since 2×500555050055552 (a number of 28 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 50055505005555.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4673711266 + ... + 4673721975.
It is an arithmetic number, because the mean of its divisors is an integer number (2187299378628).
Almost surely, 250055505005555 is an apocalyptic number.
50055505005555 is an abundant number, since it is smaller than the sum of its proper divisors (54934865168589).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50055505005555 is a wasteful number, since it uses less digits than its factorization.
50055505005555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9347433276 (or 9347433273 counting only the distinct ones).
The product of its (nonzero) digits is 1953125, while the sum is 45.
The spelling of 50055505005555 in words is "fifty trillion, fifty-five billion, five hundred five million, five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •