Base | Representation |
---|---|
bin | 10110110010010000100110… |
… | …11100001010100100100010 |
3 | 20120102000211111101002022100 |
4 | 23121020103130022210202 |
5 | 23031411342121004240 |
6 | 254322035410351230 |
7 | 13360665612102033 |
oct | 1331102334124442 |
9 | 216360744332270 |
10 | 50105414625570 |
11 | 14a68650346557 |
12 | 5752921b8b516 |
13 | 21c5bc6c53975 |
14 | c5318781aa8a |
15 | 5bd554402e30 |
hex | 2d921370a922 |
50105414625570 has 48 divisors (see below), whose sum is σ = 130274567871552. Its totient is φ = 13361393659680.
The previous prime is 50105414625559. The next prime is 50105414625577. The reversal of 50105414625570 is 7552641450105.
50105414625570 is a `hidden beast` number, since 5 + 0 + 1 + 0 + 5 + 4 + 14 + 62 + 5 + 570 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (50105414625577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27247515 + ... + 29028225.
It is an arithmetic number, because the mean of its divisors is an integer number (2714053497324).
Almost surely, 250105414625570 is an apocalyptic number.
50105414625570 is an abundant number, since it is smaller than the sum of its proper divisors (80169153245982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50105414625570 is a wasteful number, since it uses less digits than its factorization.
50105414625570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2093367 (or 2093364 counting only the distinct ones).
The product of its (nonzero) digits is 840000, while the sum is 45.
The spelling of 50105414625570 in words is "fifty trillion, one hundred five billion, four hundred fourteen million, six hundred twenty-five thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •