Base | Representation |
---|---|
bin | 10110000101011110001011… |
… | …00101010100100101001010 |
3 | 20100221220122121000211122121 |
4 | 23002233011211110211022 |
5 | 22331203203042023200 |
6 | 251143051410041454 |
7 | 13141546252413631 |
oct | 1302570545244512 |
9 | 210856577024577 |
10 | 48566510111050 |
11 | 14524a39916628 |
12 | 5544621b7928a |
13 | 2113a57717989 |
14 | bdc8bb2a8518 |
15 | 5934d6814e1a |
hex | 2c2bc595494a |
48566510111050 has 12 divisors (see below), whose sum is σ = 90333708806646. Its totient is φ = 19426604044400.
The previous prime is 48566510111029. The next prime is 48566510111089. The reversal of 48566510111050 is 5011101566584.
It can be written as a sum of positive squares in 3 ways, for example, as 40254342526161 + 8312167584889 = 6344631^2 + 2883083^2 .
It is a junction number, because it is equal to n+sod(n) for n = 48566510110988 and 48566510111006.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 485665101061 + ... + 485665101160.
Almost surely, 248566510111050 is an apocalyptic number.
48566510111050 is a deficient number, since it is larger than the sum of its proper divisors (41767198695596).
48566510111050 is a wasteful number, since it uses less digits than its factorization.
48566510111050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971330202233 (or 971330202228 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 43.
The spelling of 48566510111050 in words is "forty-eight trillion, five hundred sixty-six billion, five hundred ten million, one hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •