Base | Representation |
---|---|
bin | 10110111011101100110101… |
… | …11101111010111111101001 |
3 | 20121120001011020021121012201 |
4 | 23131312122331322333221 |
5 | 23102220223100233100 |
6 | 255131045121340201 |
7 | 13423301504243200 |
oct | 1335663275727751 |
9 | 217501136247181 |
10 | 50429810946025 |
11 | 15083187638465 |
12 | 57a5775797661 |
13 | 221a684202444 |
14 | c64b5ca82237 |
15 | 5c6bdd78b36a |
hex | 2ddd9af7afe9 |
50429810946025 has 81 divisors (see below), whose sum is σ = 73326783293967. Its totient is φ = 34304850854400.
The previous prime is 50429810945981. The next prime is 50429810946029. The reversal of 50429810946025 is 52064901892405.
The square root of 50429810946025 is 7101395.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 31511730287961 + 18918080658064 = 5613531^2 + 4349492^2 .
It is not a de Polignac number, because 50429810946025 - 29 = 50429810945513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50429810946029) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 34051188285 + ... + 34051189765.
Almost surely, 250429810946025 is an apocalyptic number.
50429810946025 is the 7101395-th square number.
50429810946025 is the 3550698-th centered octagonal number.
It is an amenable number.
50429810946025 is a deficient number, since it is larger than the sum of its proper divisors (22896972347942).
50429810946025 is an frugal number, since it uses more digits than its factorization.
50429810946025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3260 (or 1630 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 55.
The spelling of 50429810946025 in words is "fifty trillion, four hundred twenty-nine billion, eight hundred ten million, nine hundred forty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •