Base | Representation |
---|---|
bin | 10110010000010011110001… |
… | …11110110110000110100000 |
3 | 20102021111211012001102022011 |
4 | 23020021320332312012200 |
5 | 22403303320100023242 |
6 | 252030114145322304 |
7 | 13210501146610210 |
oct | 1310117076660640 |
9 | 212244735042264 |
10 | 48938887111072 |
11 | 14658957a38222 |
12 | 55a4826336394 |
13 | 213cbc0285aca |
14 | c129249b6240 |
15 | 59d02d115d17 |
hex | 2c8278fb61a0 |
48938887111072 has 96 divisors (see below), whose sum is σ = 110655744675840. Its totient is φ = 20870583187200.
The previous prime is 48938887111027. The next prime is 48938887111139. The reversal of 48938887111072 is 27011178883984.
It is a junction number, because it is equal to n+sod(n) for n = 48938887110989 and 48938887111007.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36902697 + ... + 38205847.
It is an arithmetic number, because the mean of its divisors is an integer number (1152664007040).
Almost surely, 248938887111072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48938887111072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55327872337920).
48938887111072 is an abundant number, since it is smaller than the sum of its proper divisors (61716857564768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48938887111072 is a wasteful number, since it uses less digits than its factorization.
48938887111072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1303994 (or 1303986 counting only the distinct ones).
The product of its (nonzero) digits is 43352064, while the sum is 67.
The spelling of 48938887111072 in words is "forty-eight trillion, nine hundred thirty-eight billion, eight hundred eighty-seven million, one hundred eleven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •