Base | Representation |
---|---|
bin | 101101100011110111… |
… | …110000110111010111 |
3 | 11200021022222210012200 |
4 | 231203313300313113 |
5 | 1300142032441321 |
6 | 34250145415543 |
7 | 3351200601462 |
oct | 554367606727 |
9 | 150238883180 |
10 | 48920202711 |
11 | 198241a73a6 |
12 | 959333a5b3 |
13 | 47c8143813 |
14 | 25211702d9 |
15 | 1414b9ed26 |
hex | b63df0dd7 |
48920202711 has 24 divisors (see below), whose sum is σ = 75659819040. Its totient is φ = 30350132736.
The previous prime is 48920202679. The next prime is 48920202733. The reversal of 48920202711 is 11720202984.
It is not a de Polignac number, because 48920202711 - 25 = 48920202679 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48920202781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1782675 + ... + 1809908.
It is an arithmetic number, because the mean of its divisors is an integer number (3152492460).
Almost surely, 248920202711 is an apocalyptic number.
48920202711 is a deficient number, since it is larger than the sum of its proper divisors (26739616329).
48920202711 is a wasteful number, since it uses less digits than its factorization.
48920202711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3592695 (or 3592692 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The spelling of 48920202711 in words is "forty-eight billion, nine hundred twenty million, two hundred two thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •