Base | Representation |
---|---|
bin | 10101111110110100111010… |
… | …00100111010100011011011 |
3 | 20100011002100002010022202000 |
4 | 22333122131010322203123 |
5 | 22313433111444314012 |
6 | 250450132233212043 |
7 | 13116214406252100 |
oct | 1277323504724333 |
9 | 210132302108660 |
10 | 48338197260507 |
11 | 144471291a77a0 |
12 | 5508324561023 |
13 | 20c8370730acb |
14 | bd181cc7aaa7 |
15 | 58c5c292cddc |
hex | 2bf69d13a8db |
48338197260507 has 96 divisors (see below), whose sum is σ = 92366795289600. Its totient is φ = 24699099700800.
The previous prime is 48338197260503. The next prime is 48338197260523. The reversal of 48338197260507 is 70506279183384.
48338197260507 is a `hidden beast` number, since 4 + 8 + 3 + 3 + 8 + 19 + 7 + 2 + 605 + 0 + 7 = 666.
It is not a de Polignac number, because 48338197260507 - 22 = 48338197260503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (48338197260503) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 26337907 + ... + 28113372.
It is an arithmetic number, because the mean of its divisors is an integer number (962154117600).
It is a 1-persistent number, because it is pandigital, but 2⋅48338197260507 = 96676394521014 is not.
Almost surely, 248338197260507 is an apocalyptic number.
48338197260507 is a deficient number, since it is larger than the sum of its proper divisors (44028598029093).
48338197260507 is a wasteful number, since it uses less digits than its factorization.
48338197260507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54451374 (or 54451361 counting only the distinct ones).
The product of its (nonzero) digits is 60963840, while the sum is 63.
The spelling of 48338197260507 in words is "forty-eight trillion, three hundred thirty-eight billion, one hundred ninety-seven million, two hundred sixty thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •