Base | Representation |
---|---|
bin | 101100110011100101… |
… | …111101111011000000 |
3 | 11121011212212222020000 |
4 | 230303211331323000 |
5 | 1242012204344412 |
6 | 34033533120000 |
7 | 3322134134550 |
oct | 546345757300 |
9 | 147155788200 |
10 | 48110231232 |
11 | 19448a75888 |
12 | 93a8029000 |
13 | 46c93ac05b |
14 | 248576b160 |
15 | 13b8a084dc |
hex | b3397dec0 |
48110231232 has 560 divisors, whose sum is σ = 173133227520. Its totient is φ = 12912058368.
The previous prime is 48110231231. The next prime is 48110231263. The reversal of 48110231232 is 23213201184.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 48110231196 and 48110231205.
It is not an unprimeable number, because it can be changed into a prime (48110231231) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 49242328 + ... + 49243304.
Almost surely, 248110231232 is an apocalyptic number.
48110231232 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48110231232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86566613760).
48110231232 is an abundant number, since it is smaller than the sum of its proper divisors (125022996288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48110231232 is a wasteful number, since it uses less digits than its factorization.
48110231232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1090 (or 1071 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The spelling of 48110231232 in words is "forty-eight billion, one hundred ten million, two hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •