Base | Representation |
---|---|
bin | 10110110011111000101111… |
… | …01110001111000000010011 |
3 | 20120121101010201011111121201 |
4 | 23121330113232033000103 |
5 | 23033320341141433120 |
6 | 254403443123132031 |
7 | 13365015203611363 |
oct | 1331742756170023 |
9 | 216541121144551 |
10 | 50161321046035 |
11 | 14a8a32a033731 |
12 | 5761724b14017 |
13 | 21cb266586134 |
14 | c55b6c75a9a3 |
15 | 5bec2759840a |
hex | 2d9f17b8f013 |
50161321046035 has 4 divisors (see below), whose sum is σ = 60193585255248. Its totient is φ = 40129056836824.
The previous prime is 50161321046017. The next prime is 50161321046071. The reversal of 50161321046035 is 53064012316105.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50161321046035 - 229 = 50160784175123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50161321045985 and 50161321046003.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5016132104599 + ... + 5016132104608.
It is an arithmetic number, because the mean of its divisors is an integer number (15048396313812).
Almost surely, 250161321046035 is an apocalyptic number.
50161321046035 is a deficient number, since it is larger than the sum of its proper divisors (10032264209213).
50161321046035 is a wasteful number, since it uses less digits than its factorization.
50161321046035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10032264209212.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 50161321046035 in words is "fifty trillion, one hundred sixty-one billion, three hundred twenty-one million, forty-six thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •