Base | Representation |
---|---|
bin | 10110111011110100100110… |
… | …01010010101111010001100 |
3 | 20121120102220102120222222002 |
4 | 23131322103022111322030 |
5 | 23102302240041422224 |
6 | 255133014230411432 |
7 | 13423506625561061 |
oct | 1335722312257214 |
9 | 217512812528862 |
10 | 50433974951564 |
11 | 15084a2405a456 |
12 | 57a6538200b78 |
13 | 221ab98ab7849 |
14 | c65035ac8c68 |
15 | 5c6d8410a9ae |
hex | 2dde93295e8c |
50433974951564 has 6 divisors (see below), whose sum is σ = 88259456165244. Its totient is φ = 25216987475780.
The previous prime is 50433974951561. The next prime is 50433974951579. The reversal of 50433974951564 is 46515947933405.
It is a super-2 number, since 2×504339749515642 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50433974951564.
It is not an unprimeable number, because it can be changed into a prime (50433974951561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6304246868942 + ... + 6304246868949.
It is an arithmetic number, because the mean of its divisors is an integer number (14709909360874).
Almost surely, 250433974951564 is an apocalyptic number.
It is an amenable number.
50433974951564 is a deficient number, since it is larger than the sum of its proper divisors (37825481213680).
50433974951564 is a wasteful number, since it uses less digits than its factorization.
50433974951564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12608493737895 (or 12608493737893 counting only the distinct ones).
The product of its (nonzero) digits is 244944000, while the sum is 65.
The spelling of 50433974951564 in words is "fifty trillion, four hundred thirty-three billion, nine hundred seventy-four million, nine hundred fifty-one thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •