Base | Representation |
---|---|
bin | 10110110010111111001111… |
… | …01111010100110010001101 |
3 | 20120111102110100012121110002 |
4 | 23121133213233110302031 |
5 | 23032314131010120123 |
6 | 254341340020254045 |
7 | 13362543212661035 |
oct | 1331374757246215 |
9 | 216442410177402 |
10 | 50130451254413 |
11 | 14a78228920352 |
12 | 575774a841325 |
13 | 21c8386c4344a |
14 | c544809ba8c5 |
15 | 5be01c40d528 |
hex | 2d97e7bd4c8d |
50130451254413 has 16 divisors (see below), whose sum is σ = 53170175565360. Its totient is φ = 47100880819200.
The previous prime is 50130451254409. The next prime is 50130451254421. The reversal of 50130451254413 is 31445215403105.
It can be written as a sum of positive squares in 8 ways, for example, as 72944286724 + 50057506967689 = 270082^2 + 7075133^2 .
It is a cyclic number.
It is not a de Polignac number, because 50130451254413 - 22 = 50130451254409 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50130451254493) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27433643 + ... + 29203863.
It is an arithmetic number, because the mean of its divisors is an integer number (3323135972835).
Almost surely, 250130451254413 is an apocalyptic number.
It is an amenable number.
50130451254413 is a deficient number, since it is larger than the sum of its proper divisors (3039724310947).
50130451254413 is a wasteful number, since it uses less digits than its factorization.
50130451254413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1773088.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 50130451254413 its reverse (31445215403105), we get a palindrome (81575666657518).
The spelling of 50130451254413 in words is "fifty trillion, one hundred thirty billion, four hundred fifty-one million, two hundred fifty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •