Base | Representation |
---|---|
bin | 11000000111111110000100… |
… | …10100100110010010011001 |
3 | 20221211120100200021110011201 |
4 | 30003333002110212102121 |
5 | 23423134210210040010 |
6 | 304455003510354201 |
7 | 14113523253310306 |
oct | 1403770224462231 |
9 | 227746320243151 |
10 | 53050401252505 |
11 | 159a3604538858 |
12 | 5b4963405b961 |
13 | 237a8291822c7 |
14 | d159202400ad |
15 | 61ee690a823a |
hex | 303fc2526499 |
53050401252505 has 4 divisors (see below), whose sum is σ = 63660481503012. Its totient is φ = 42440321002000.
The previous prime is 53050401252463. The next prime is 53050401252523. The reversal of 53050401252505 is 50525210405035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25866826371136 + 27183574881369 = 5085944^2 + 5213787^2 .
It is not a de Polignac number, because 53050401252505 - 27 = 53050401252377 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5305040125246 + ... + 5305040125255.
It is an arithmetic number, because the mean of its divisors is an integer number (15915120375753).
Almost surely, 253050401252505 is an apocalyptic number.
It is an amenable number.
53050401252505 is a deficient number, since it is larger than the sum of its proper divisors (10610080250507).
53050401252505 is a wasteful number, since it uses less digits than its factorization.
53050401252505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10610080250506.
The product of its (nonzero) digits is 150000, while the sum is 37.
The spelling of 53050401252505 in words is "fifty-three trillion, fifty billion, four hundred one million, two hundred fifty-two thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •