Base | Representation |
---|---|
bin | 101101001000100010… |
… | …101010100111110001 |
3 | 11122002101012210021201 |
4 | 231020202222213301 |
5 | 1243222142443111 |
6 | 34132450051201 |
7 | 3333632355010 |
oct | 551042524761 |
9 | 148071183251 |
10 | 48461687281 |
11 | 196093a4a27 |
12 | 9485879b01 |
13 | 4754154c07 |
14 | 24ba2d6a77 |
15 | 13d97cd6c1 |
hex | b488aa9f1 |
48461687281 has 8 divisors (see below), whose sum is σ = 55419007680. Its totient is φ = 41512922448.
The previous prime is 48461687251. The next prime is 48461687311. The reversal of 48461687281 is 18278616484.
It is an interprime number because it is at equal distance from previous prime (48461687251) and next prime (48461687311).
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 48461687281 - 219 = 48461162993 is a prime.
It is a super-2 number, since 2×484616872812 (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 (48461687251) 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, 2126746 + ... + 2149411.
It is an arithmetic number, because the mean of its divisors is an integer number (6927375960).
Almost surely, 248461687281 is an apocalyptic number.
It is an amenable number.
48461687281 is a deficient number, since it is larger than the sum of its proper divisors (6957320399).
48461687281 is a wasteful number, since it uses less digits than its factorization.
48461687281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4277783.
The product of its digits is 4128768, while the sum is 55.
The spelling of 48461687281 in words is "forty-eight billion, four hundred sixty-one million, six hundred eighty-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •