Base | Representation |
---|---|
bin | 10110111011001101111100… |
… | …01100111111110101101101 |
3 | 20121111110100010200120202221 |
4 | 23131212332030333311231 |
5 | 23101432234342401110 |
6 | 255115303051515341 |
7 | 13422143433425545 |
oct | 1335467614776555 |
9 | 217443303616687 |
10 | 50413222231405 |
11 | 15077144752660 |
12 | 57a2506158b51 |
13 | 2218c3c4a2287 |
14 | c64027864325 |
15 | 5c656c2567da |
hex | 2dd9be33fd6d |
50413222231405 has 16 divisors (see below), whose sum is σ = 65995936919424. Its totient is φ = 36663913846080.
The previous prime is 50413222231391. The next prime is 50413222231447.
50413222231405 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50413222231405 - 27 = 50413222231277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5321419 + ... + 11364151.
It is an arithmetic number, because the mean of its divisors is an integer number (4124746057464).
Almost surely, 250413222231405 is an apocalyptic number.
50413222231405 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50413222231405 is a deficient number, since it is larger than the sum of its proper divisors (15582714688019).
50413222231405 is a wasteful number, since it uses less digits than its factorization.
50413222231405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6194436.
The product of its (nonzero) digits is 57600, while the sum is 34.
It can be divided in two parts, 5041322 and 2231405, that added together give a palindrome (7272727).
The spelling of 50413222231405 in words is "fifty trillion, four hundred thirteen billion, two hundred twenty-two million, two hundred thirty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •