Base | Representation |
---|---|
bin | 101110101010010010… |
… | …000110001111100100 |
3 | 11210022122211110201201 |
4 | 232222102012033210 |
5 | 1310101441324030 |
6 | 35003305132244 |
7 | 3422363550412 |
oct | 565222061744 |
9 | 153278743651 |
10 | 50101511140 |
11 | 1a27aaa695a |
12 | 9862a8a084 |
13 | 4955ac22a5 |
14 | 25d3dd62b2 |
15 | 14837472ca |
hex | baa4863e4 |
50101511140 has 12 divisors (see below), whose sum is σ = 105213173436. Its totient is φ = 20040604448.
The previous prime is 50101511113. The next prime is 50101511167. The reversal of 50101511140 is 4111510105.
It is an interprime number because it is at equal distance from previous prime (50101511113) and next prime (50101511167).
It can be written as a sum of positive squares in 2 ways, for example, as 20909738404 + 29191772736 = 144602^2 + 170856^2 .
It is a super-2 number, since 2×501015111402 (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 3 ways as a sum of consecutive naturals, for example, 1252537759 + ... + 1252537798.
It is an arithmetic number, because the mean of its divisors is an integer number (8767764453).
Almost surely, 250101511140 is an apocalyptic number.
It is an amenable number.
50101511140 is an abundant number, since it is smaller than the sum of its proper divisors (55111662296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50101511140 is a wasteful number, since it uses less digits than its factorization.
50101511140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2505075566 (or 2505075564 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 19.
The spelling of 50101511140 in words is "fifty billion, one hundred one million, five hundred eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •