Base | Representation |
---|---|
bin | 10110000100101101001001… |
… | …11110000010101101000101 |
3 | 20100212101201112000011112112 |
4 | 23002112210332002231011 |
5 | 22330240303420431100 |
6 | 251123020142030405 |
7 | 13136625144015263 |
oct | 1302264476025505 |
9 | 210771645004475 |
10 | 48540193139525 |
11 | 1451486465038a |
12 | 553b4b8578405 |
13 | 21114223b3689 |
14 | bdb502063433 |
15 | 5929961edb35 |
hex | 2c25a4f82b45 |
48540193139525 has 12 divisors (see below), whose sum is σ = 60192434490084. Its totient is φ = 38830480320000.
The previous prime is 48540193139513. The next prime is 48540193139587. The reversal of 48540193139525 is 52593139104584.
It can be written as a sum of positive squares in 6 ways, for example, as 1343526719236 + 47196666420289 = 1159106^2 + 6869983^2 .
It is not a de Polignac number, because 48540193139525 - 238 = 48265315232581 is a prime.
It is a super-2 number, since 2×485401931395252 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41263166 + ... + 42423215.
It is an arithmetic number, because the mean of its divisors is an integer number (5016036207507).
Almost surely, 248540193139525 is an apocalyptic number.
It is an amenable number.
48540193139525 is a deficient number, since it is larger than the sum of its proper divisors (11652241350559).
48540193139525 is a wasteful number, since it uses less digits than its factorization.
48540193139525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83709592 (or 83709587 counting only the distinct ones).
The product of its (nonzero) digits is 23328000, while the sum is 59.
The spelling of 48540193139525 in words is "forty-eight trillion, five hundred forty billion, one hundred ninety-three million, one hundred thirty-nine thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •