Base | Representation |
---|---|
bin | 101101100011010001… |
… | …101010110100000011 |
3 | 11200020122012102122012 |
4 | 231203101222310003 |
5 | 1300132003411301 |
6 | 34245151403135 |
7 | 3351016660145 |
oct | 554321526403 |
9 | 150218172565 |
10 | 48910216451 |
11 | 198195a6598 |
12 | 958bb234ab |
13 | 47c60582a5 |
14 | 251dad0c95 |
15 | 1413d7aebb |
hex | b6346ad03 |
48910216451 has 4 divisors (see below), whose sum is σ = 48914250504. Its totient is φ = 48906182400.
The previous prime is 48910216429. The next prime is 48910216457. The reversal of 48910216451 is 15461201984.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48910216451 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48910216399 and 48910216408.
It is not an unprimeable number, because it can be changed into a prime (48910216457) 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 3 ways as a sum of consecutive naturals, for example, 1998785 + ... + 2023106.
It is an arithmetic number, because the mean of its divisors is an integer number (12228562626).
Almost surely, 248910216451 is an apocalyptic number.
48910216451 is a deficient number, since it is larger than the sum of its proper divisors (4034053).
48910216451 is a wasteful number, since it uses less digits than its factorization.
48910216451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4034052.
The product of its (nonzero) digits is 69120, while the sum is 41.
The spelling of 48910216451 in words is "forty-eight billion, nine hundred ten million, two hundred sixteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •