Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …10101111111110110110010 |
3 | 20121210210202011021212121121 |
4 | 23132320103111333312302 |
5 | 23104400111300000200 |
6 | 255223344333012454 |
7 | 13431354464262253 |
oct | 1336702325776662 |
9 | 217723664255547 |
10 | 50500550000050 |
11 | 15100187a23787 |
12 | 57b741802412a |
13 | 22242487b1267 |
14 | c6834d8bab2a |
15 | 5c897dbd5e1a |
hex | 2dee1357fdb2 |
50500550000050 has 48 divisors (see below), whose sum is σ = 96127783678080. Its totient is φ = 19727918763840.
The previous prime is 50500550000039. The next prime is 50500550000051. The reversal of 50500550000050 is 5000005500505.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (50500550000051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15318196 + ... + 18320704.
It is an arithmetic number, because the mean of its divisors is an integer number (2002662159960).
Almost surely, 250500550000050 is an apocalyptic number.
50500550000050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50500550000050 is a deficient number, since it is larger than the sum of its proper divisors (45627233678030).
50500550000050 is a wasteful number, since it uses less digits than its factorization.
50500550000050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3010387 (or 3010382 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 25.
Adding to 50500550000050 its reverse (5000005500505), we get a palindrome (55500555500555).
The spelling of 50500550000050 in words is "fifty trillion, five hundred billion, five hundred fifty million, fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •