Base | Representation |
---|---|
bin | 10101110100111111001011… |
… | …00000101111111010000101 |
3 | 20021221202200012111002010022 |
4 | 22322133211200233322011 |
5 | 22242413211141200401 |
6 | 250030540212104525 |
7 | 13052615321642435 |
oct | 1272374540577205 |
9 | 207852605432108 |
10 | 48000110100101 |
11 | 14326806878125 |
12 | 54728ab905145 |
13 | 20a2510c2a6c3 |
14 | bbd3096182c5 |
15 | 5838d667e71b |
hex | 2ba7e582fe85 |
48000110100101 has 2 divisors, whose sum is σ = 48000110100102. Its totient is φ = 48000110100100.
The previous prime is 48000110100073. The next prime is 48000110100133. The reversal of 48000110100101 is 10100101100084.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45746298487201 + 2253811612900 = 6763601^2 + 1501270^2 .
It is a cyclic number.
It is not a de Polignac number, because 48000110100101 - 26 = 48000110100037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 48000110100101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48000110100601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24000055050050 + 24000055050051.
It is an arithmetic number, because the mean of its divisors is an integer number (24000055050051).
Almost surely, 248000110100101 is an apocalyptic number.
It is an amenable number.
48000110100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
48000110100101 is an equidigital number, since it uses as much as digits as its factorization.
48000110100101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 48000110100101 its reverse (10100101100084), we get a palindrome (58100211200185).
The spelling of 48000110100101 in words is "forty-eight trillion, one hundred ten million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •