Base | Representation |
---|---|
bin | 101100111000011100… |
… | …010000000000110001 |
3 | 11121101112221101222211 |
4 | 230320130100000301 |
5 | 1242144020214334 |
6 | 34050000332121 |
7 | 3324142404664 |
oct | 547034200061 |
9 | 147345841884 |
10 | 48191569969 |
11 | 1948a980884 |
12 | 940b314041 |
13 | 47101ba89a |
14 | 24924a16db |
15 | 13c0c23a64 |
hex | b38710031 |
48191569969 has 4 divisors (see below), whose sum is σ = 48363070500. Its totient is φ = 48020069440.
The previous prime is 48191569919. The next prime is 48191570047. The reversal of 48191569969 is 96996519184.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 42724890000 + 5466679969 = 206700^2 + 73937^2 .
It is a cyclic number.
It is not a de Polignac number, because 48191569969 - 29 = 48191569457 is a prime.
It is a super-2 number, since 2×481915699692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48191569919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85749844 + ... + 85750405.
It is an arithmetic number, because the mean of its divisors is an integer number (12090767625).
Almost surely, 248191569969 is an apocalyptic number.
It is an amenable number.
48191569969 is a deficient number, since it is larger than the sum of its proper divisors (171500531).
48191569969 is a wasteful number, since it uses less digits than its factorization.
48191569969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171500530.
The product of its digits is 37791360, while the sum is 67.
The spelling of 48191569969 in words is "forty-eight billion, one hundred ninety-one million, five hundred sixty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •