Base | Representation |
---|---|
bin | 10110111001000111110111… |
… | …10111000001000000111101 |
3 | 20121020120112201120202110121 |
4 | 23130203323313001000331 |
5 | 23044242331001244123 |
6 | 255022240350134541 |
7 | 13414014624364015 |
oct | 1334437367010075 |
9 | 217216481522417 |
10 | 50341242212413 |
11 | 15049667920a59 |
12 | 57905781b1451 |
13 | 221220aa88169 |
14 | c60759cb4c45 |
15 | 5c4757dcd75d |
hex | 2dc8fbdc103d |
50341242212413 has 32 divisors (see below), whose sum is σ = 52393767414912. Its totient is φ = 48326743296000.
The previous prime is 50341242212383. The next prime is 50341242212449. The reversal of 50341242212413 is 31421224214305.
It is a cyclic number.
It is not a de Polignac number, because 50341242212413 - 25 = 50341242212381 is a prime.
It is a super-2 number, since 2×503412422124132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50341242212473) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10663255893 + ... + 10663260613.
It is an arithmetic number, because the mean of its divisors is an integer number (1637305231716).
Almost surely, 250341242212413 is an apocalyptic number.
It is an amenable number.
50341242212413 is a deficient number, since it is larger than the sum of its proper divisors (2052525202499).
50341242212413 is a wasteful number, since it uses less digits than its factorization.
50341242212413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8685.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 50341242212413 its reverse (31421224214305), we get a palindrome (81762466426718).
The spelling of 50341242212413 in words is "fifty trillion, three hundred forty-one billion, two hundred forty-two million, two hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •