Base | Representation |
---|---|
bin | 10110110000110011101010… |
… | …11111010110101000100001 |
3 | 20120020021001020212120001212 |
4 | 23120121311133112220201 |
5 | 23030102201111133100 |
6 | 254243104412035505 |
7 | 13354251310002461 |
oct | 1330316537265041 |
9 | 216207036776055 |
10 | 50055520021025 |
11 | 14a4947711a692 |
12 | 5745118462b95 |
13 | 21c12a4c9651c |
14 | c509b30c3ba1 |
15 | 5bc0d3e2b635 |
hex | 2d86757d6a21 |
50055520021025 has 12 divisors (see below), whose sum is σ = 62068960221804. Its totient is φ = 40044341568000.
The previous prime is 50055520020991. The next prime is 50055520021027. The reversal of 50055520021025 is 52012002555005.
It can be written as a sum of positive squares in 6 ways, for example, as 2788258756864 + 47267261264161 = 1669808^2 + 6875119^2 .
It is not a de Polignac number, because 50055520021025 - 28 = 50055520020769 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50055520020982 and 50055520021000.
It is not an unprimeable number, because it can be changed into a prime (50055520021027) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14767865 + ... + 17838185.
It is an arithmetic number, because the mean of its divisors is an integer number (5172413351817).
Almost surely, 250055520021025 is an apocalyptic number.
It is an amenable number.
50055520021025 is a deficient number, since it is larger than the sum of its proper divisors (12013440200779).
50055520021025 is a wasteful number, since it uses less digits than its factorization.
50055520021025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3722452 (or 3722447 counting only the distinct ones).
The product of its (nonzero) digits is 25000, while the sum is 32.
The spelling of 50055520021025 in words is "fifty trillion, fifty-five billion, five hundred twenty million, twenty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •