Base | Representation |
---|---|
bin | 1011100010100… |
… | …0101111010001 |
3 | 10101002001012000 |
4 | 2320220233101 |
5 | 44342320421 |
6 | 4445224213 |
7 | 1125255561 |
oct | 270505721 |
9 | 111061160 |
10 | 48401361 |
11 | 25359728 |
12 | 14262069 |
13 | a048878 |
14 | 65dcda1 |
15 | 43b1226 |
hex | 2e28bd1 |
48401361 has 32 divisors (see below), whose sum is σ = 76688640. Its totient is φ = 30096000.
The previous prime is 48401317. The next prime is 48401371. The reversal of 48401361 is 16310484.
48401361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 48401361 - 210 = 48400337 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (48401371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24511 + ... + 26411.
It is an arithmetic number, because the mean of its divisors is an integer number (2396520).
Almost surely, 248401361 is an apocalyptic number.
48401361 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
48401361 is a deficient number, since it is larger than the sum of its proper divisors (28287279).
48401361 is a wasteful number, since it uses less digits than its factorization.
48401361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1974 (or 1968 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 48401361 is about 6957.1086666804. The cubic root of 48401361 is about 364.4342545988.
The spelling of 48401361 in words is "forty-eight million, four hundred one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •