Base | Representation |
---|---|
bin | 101101011001001101… |
… | …011110110000000001 |
3 | 11122210212102221100100 |
4 | 231121031132300001 |
5 | 1244310241040210 |
6 | 34220320113013 |
7 | 3343566415311 |
oct | 553115366001 |
9 | 148725387310 |
10 | 48741346305 |
11 | 19742245993 |
12 | 9543465769 |
13 | 479a080322 |
14 | 25054d3441 |
15 | 14041205c0 |
hex | b5935ec01 |
48741346305 has 24 divisors (see below), whose sum is σ = 84543338880. Its totient is φ = 25977434400.
The previous prime is 48741346301. The next prime is 48741346337. The reversal of 48741346305 is 50364314784.
48741346305 is a `hidden beast` number, since 4 + 8 + 7 + 4 + 1 + 3 + 4 + 630 + 5 = 666.
It is not a de Polignac number, because 48741346305 - 22 = 48741346301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (48741346301) 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 23 ways as a sum of consecutive naturals, for example, 307945 + ... + 438534.
It is an arithmetic number, because the mean of its divisors is an integer number (3522639120).
Almost surely, 248741346305 is an apocalyptic number.
48741346305 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
48741346305 is a deficient number, since it is larger than the sum of its proper divisors (35801992575).
48741346305 is a wasteful number, since it uses less digits than its factorization.
48741346305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747941 (or 747938 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 45.
The spelling of 48741346305 in words is "forty-eight billion, seven hundred forty-one million, three hundred forty-six thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •