Base | Representation |
---|---|
bin | 101111000100101110… |
… | …010000100101011001 |
3 | 11211110120112011211011 |
4 | 233010232100211121 |
5 | 1312004021214040 |
6 | 35115312533521 |
7 | 3436361161630 |
oct | 570456204531 |
9 | 154416464734 |
10 | 50545101145 |
11 | 1a488434670 |
12 | 99675512a1 |
13 | 49c6986496 |
14 | 2636ca6517 |
15 | 14ac66b3ea |
hex | bc4b90959 |
50545101145 has 32 divisors (see below), whose sum is σ = 77465154816. Its totient is φ = 30740121600.
The previous prime is 50545101133. The next prime is 50545101169. The reversal of 50545101145 is 54110154505.
It is not a de Polignac number, because 50545101145 - 213 = 50545092953 is a prime.
It is a super-2 number, since 2×505451011452 (a number of 22 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 1585264 + ... + 1616833.
It is an arithmetic number, because the mean of its divisors is an integer number (2420786088).
Almost surely, 250545101145 is an apocalyptic number.
50545101145 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50545101145 is a deficient number, since it is larger than the sum of its proper divisors (26920053671).
50545101145 is a wasteful number, since it uses less digits than its factorization.
50545101145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3202161.
The product of its (nonzero) digits is 10000, while the sum is 31.
The spelling of 50545101145 in words is "fifty billion, five hundred forty-five million, one hundred one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •