Base | Representation |
---|---|
bin | 101101011001111010… |
… | …001111110100000001 |
3 | 11122211200112011010221 |
4 | 231121322033310001 |
5 | 1244321242102401 |
6 | 34221415423041 |
7 | 3344101233100 |
oct | 553172176401 |
9 | 148750464127 |
10 | 48753081601 |
11 | 19748930884 |
12 | 9547384a81 |
13 | 479c62b9a3 |
14 | 2506caa037 |
15 | 140518c7a1 |
hex | b59e8fd01 |
48753081601 has 9 divisors (see below), whose sum is σ = 56714566401. Its totient is φ = 41787030852.
The previous prime is 48753081569. The next prime is 48753081613. The reversal of 48753081601 is 10618035784.
The square root of 48753081601 is 220801.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 48753081601 - 25 = 48753081569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48753081631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1529836 + ... + 1561378.
It is an arithmetic number, because the mean of its divisors is an integer number (6301618489).
Almost surely, 248753081601 is an apocalyptic number.
48753081601 is the 220801-st square number.
48753081601 is the 110401-st centered octagonal number.
It is an amenable number.
48753081601 is a deficient number, since it is larger than the sum of its proper divisors (7961484800).
48753081601 is an frugal number, since it uses more digits than its factorization.
48753081601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63100 (or 31550 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 43.
The spelling of 48753081601 in words is "forty-eight billion, seven hundred fifty-three million, eighty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •