Base | Representation |
---|---|
bin | 101101010000110111… |
… | …010100100000110110 |
3 | 11122110002221211122120 |
4 | 231100313110200312 |
5 | 1244013414210403 |
6 | 34154354540410 |
7 | 3340246253655 |
oct | 552067244066 |
9 | 148402854576 |
10 | 48601319478 |
11 | 196801a5738 |
12 | 9504597706 |
13 | 4777063a0a |
14 | 24d0a8319c |
15 | 13e6bb0e53 |
hex | b50dd4836 |
48601319478 has 16 divisors (see below), whose sum is σ = 98373756096. Its totient is φ = 16005253640.
The previous prime is 48601319471. The next prime is 48601319497. The reversal of 48601319478 is 87491310684.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 48601319478.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48601319471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48796008 + ... + 48797003.
It is an arithmetic number, because the mean of its divisors is an integer number (6148359756).
Almost surely, 248601319478 is an apocalyptic number.
48601319478 is an abundant number, since it is smaller than the sum of its proper divisors (49772436618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48601319478 is a wasteful number, since it uses less digits than its factorization.
48601319478 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97593099.
The product of its (nonzero) digits is 1161216, while the sum is 51.
The spelling of 48601319478 in words is "forty-eight billion, six hundred one million, three hundred nineteen thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •