Base | Representation |
---|---|
bin | 101101001110001101… |
… | …110000101001010111 |
3 | 11122100000022120202011 |
4 | 231032031300221113 |
5 | 1243421024321411 |
6 | 34150130125051 |
7 | 3336166405222 |
oct | 551615605127 |
9 | 148300276664 |
10 | 48556870231 |
11 | 196580a6321 |
12 | 94b1720787 |
13 | 476aa9cc9c |
14 | 24c8bd25b9 |
15 | 13e2d30c21 |
hex | b4e370a57 |
48556870231 has 8 divisors (see below), whose sum is σ = 51121422000. Its totient is φ = 45993211200.
The previous prime is 48556870199. The next prime is 48556870261. The reversal of 48556870231 is 13207865584.
It is a happy number.
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 48556870231 - 25 = 48556870199 is a prime.
It is a super-2 number, since 2×485568702312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48556870261) 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, 110056 + ... + 330493.
It is an arithmetic number, because the mean of its divisors is an integer number (6390177750).
Almost surely, 248556870231 is an apocalyptic number.
48556870231 is a deficient number, since it is larger than the sum of its proper divisors (2564551769).
48556870231 is a wasteful number, since it uses less digits than its factorization.
48556870231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446369.
The product of its (nonzero) digits is 1612800, while the sum is 49.
The spelling of 48556870231 in words is "forty-eight billion, five hundred fifty-six million, eight hundred seventy thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •