Base | Representation |
---|---|
bin | 10110110010000111110101… |
… | …01111001100001010110000 |
3 | 20120101120200021210020201021 |
4 | 23121003322233030022300 |
5 | 23031322221013341102 |
6 | 254315540215345224 |
7 | 13360441115551354 |
oct | 1331037257141260 |
9 | 216346607706637 |
10 | 50100705215152 |
11 | 14a66653a75829 |
12 | 5751a28982214 |
13 | 21c5626379797 |
14 | c52c5c19d464 |
15 | 5bd37ac4c137 |
hex | 2d90fabcc2b0 |
50100705215152 has 10 divisors (see below), whose sum is σ = 97070116354388. Its totient is φ = 25050352607568.
The previous prime is 50100705215137. The next prime is 50100705215173. The reversal of 50100705215152 is 25151250700105.
50100705215152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×501007052151522 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1565647037958 + ... + 1565647037989.
Almost surely, 250100705215152 is an apocalyptic number.
It is an amenable number.
50100705215152 is a deficient number, since it is larger than the sum of its proper divisors (46969411139236).
50100705215152 is a wasteful number, since it uses less digits than its factorization.
50100705215152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3131294075955 (or 3131294075949 counting only the distinct ones).
The product of its (nonzero) digits is 17500, while the sum is 34.
Adding to 50100705215152 its reverse (25151250700105), we get a palindrome (75251955915257).
The spelling of 50100705215152 in words is "fifty trillion, one hundred billion, seven hundred five million, two hundred fifteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •