Base | Representation |
---|---|
bin | 10110000110100010011010… |
… | …01010101110110000111001 |
3 | 20101002102012201020200200121 |
4 | 23003101031022232300321 |
5 | 22332303220003031103 |
6 | 251211550521533241 |
7 | 13144314142311202 |
oct | 1303211512566071 |
9 | 211072181220617 |
10 | 48603144580153 |
11 | 14539529041479 |
12 | 554b746944221 |
13 | 2117345452627 |
14 | c005948bc5a9 |
15 | 59442cb026bd |
hex | 2c344d2aec39 |
48603144580153 has 4 divisors (see below), whose sum is σ = 48603171845248. Its totient is φ = 48603117315060.
The previous prime is 48603144580103. The next prime is 48603144580163. The reversal of 48603144580153 is 35108544130684.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48603144580153 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 48603144580153.
It is not an unprimeable number, because it can be changed into a prime (48603144580103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10756353 + ... + 14591278.
It is an arithmetic number, because the mean of its divisors is an integer number (12150792961312).
Almost surely, 248603144580153 is an apocalyptic number.
It is an amenable number.
48603144580153 is a deficient number, since it is larger than the sum of its proper divisors (27265095).
48603144580153 is a wasteful number, since it uses less digits than its factorization.
48603144580153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27265094.
The product of its (nonzero) digits is 5529600, while the sum is 52.
The spelling of 48603144580153 in words is "forty-eight trillion, six hundred three billion, one hundred forty-four million, five hundred eighty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •