Base | Representation |
---|---|
bin | 10110000011101100100010… |
… | …11101001010101101000001 |
3 | 20100202002012010001201112020 |
4 | 23001312101131022231001 |
5 | 22324203234020003230 |
6 | 251055042152352053 |
7 | 13134256441231410 |
oct | 1301662135125501 |
9 | 210662163051466 |
10 | 48505506016065 |
11 | 145010846790aa |
12 | 55348379a5629 |
13 | 210b084c48757 |
14 | bd997131d477 |
15 | 591b15d72810 |
hex | 2c1d9174ab41 |
48505506016065 has 32 divisors (see below), whose sum is σ = 90582926745600. Its totient is φ = 21702159528384.
The previous prime is 48505506016021. The next prime is 48505506016067. The reversal of 48505506016065 is 56061060550584.
It is not a de Polignac number, because 48505506016065 - 243 = 39709412993857 is a prime.
It is a super-2 number, since 2×485055060160652 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 48505506015999 and 48505506016017.
It is not an unprimeable number, because it can be changed into a prime (48505506016067) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4914433365 + ... + 4914443234.
It is an arithmetic number, because the mean of its divisors is an integer number (2830716460800).
Almost surely, 248505506016065 is an apocalyptic number.
It is an amenable number.
48505506016065 is a deficient number, since it is larger than the sum of its proper divisors (42077420729535).
48505506016065 is a wasteful number, since it uses less digits than its factorization.
48505506016065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9828876661.
The product of its (nonzero) digits is 4320000, while the sum is 51.
The spelling of 48505506016065 in words is "forty-eight trillion, five hundred five billion, five hundred six million, sixteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •