Base | Representation |
---|---|
bin | 101111000010111000… |
… | …001100011001100110 |
3 | 11211101102021202020000 |
4 | 233002320030121212 |
5 | 1311423110313024 |
6 | 35112245322130 |
7 | 3435534125205 |
oct | 570270143146 |
9 | 154342252200 |
10 | 50514151014 |
11 | 1a471a15348 |
12 | 9959106346 |
13 | 49c043abb2 |
14 | 2632b2b23c |
15 | 14a9aa5cc9 |
hex | bc2e0c666 |
50514151014 has 40 divisors (see below), whose sum is σ = 115821437160. Its totient is φ = 16446465504.
The previous prime is 50514151001. The next prime is 50514151031. The reversal of 50514151014 is 41015141505.
50514151014 is a `hidden beast` number, since 5 + 0 + 5 + 141 + 510 + 1 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3618799 + ... + 3632730.
It is an arithmetic number, because the mean of its divisors is an integer number (2895535929).
Almost surely, 250514151014 is an apocalyptic number.
50514151014 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
50514151014 is an abundant number, since it is smaller than the sum of its proper divisors (65307286146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50514151014 is a wasteful number, since it uses less digits than its factorization.
50514151014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7251586 (or 7251577 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
Adding to 50514151014 its reverse (41015141505), we get a palindrome (91529292519).
The spelling of 50514151014 in words is "fifty billion, five hundred fourteen million, one hundred fifty-one thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •