Base | Representation |
---|---|
bin | 101101000001100101… |
… | …110001101011111001 |
3 | 11121210020202121122221 |
4 | 231001211301223321 |
5 | 1243002313442022 |
6 | 34113122244041 |
7 | 3331015151011 |
oct | 550145615371 |
9 | 147706677587 |
10 | 48345062137 |
11 | 19559588809 |
12 | 94527b6621 |
13 | 4735c40158 |
14 | 24a8a18c41 |
15 | 13ce442cc7 |
hex | b41971af9 |
48345062137 has 8 divisors (see below), whose sum is σ = 50862703752. Its totient is φ = 45891158400.
The previous prime is 48345062093. The next prime is 48345062141. The reversal of 48345062137 is 73126054384.
It can be written as a sum of positive squares in 4 ways, for example, as 12328993296 + 36016068841 = 111036^2 + 189779^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48345062137 - 219 = 48344537849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48345062093 and 48345062102.
It is not an unprimeable number, because it can be changed into a prime (48345062167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15932914 + ... + 15935947.
It is an arithmetic number, because the mean of its divisors is an integer number (6357837969).
Almost surely, 248345062137 is an apocalyptic number.
It is an amenable number.
48345062137 is a deficient number, since it is larger than the sum of its proper divisors (2517641615).
48345062137 is a wasteful number, since it uses less digits than its factorization.
48345062137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31868939.
The product of its (nonzero) digits is 483840, while the sum is 43.
The spelling of 48345062137 in words is "forty-eight billion, three hundred forty-five million, sixty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •