Base | Representation |
---|---|
bin | 10110110010100010101001… |
… | …11011111011010010011001 |
3 | 20120102221211201112002100200 |
4 | 23121101110323323102121 |
5 | 23032041212432431314 |
6 | 254330321034452413 |
7 | 13361460660263013 |
oct | 1331212473732231 |
9 | 216387751462320 |
10 | 50115103405209 |
11 | 14a71772413057 |
12 | 5754786894109 |
13 | 21c6aac31517b |
14 | c538264c91b3 |
15 | 5bd91ecd7709 |
hex | 2d9454efb499 |
50115103405209 has 24 divisors (see below), whose sum is σ = 74154947265672. Its totient is φ = 32594797198080.
The previous prime is 50115103405183. The next prime is 50115103405223. The reversal of 50115103405209 is 90250430151105.
It is a happy number.
50115103405209 is a `hidden beast` number, since 5 + 0 + 115 + 10 + 3 + 4 + 0 + 520 + 9 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 1667197440000 + 48447905965209 = 1291200^2 + 6960453^2 .
It is not a de Polignac number, because 50115103405209 - 25 = 50115103405177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50115103405259) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31653867 + ... + 33199359.
It is an arithmetic number, because the mean of its divisors is an integer number (3089789469403).
Almost surely, 250115103405209 is an apocalyptic number.
It is an amenable number.
50115103405209 is a deficient number, since it is larger than the sum of its proper divisors (24039843860463).
50115103405209 is a wasteful number, since it uses less digits than its factorization.
50115103405209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1633417 (or 1633414 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 50115103405209 in words is "fifty trillion, one hundred fifteen billion, one hundred three million, four hundred five thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •