Base | Representation |
---|---|
bin | 10101111100101111111101… |
… | …11110101010000011000101 |
3 | 20022220021010001021021002022 |
4 | 22332113332332222003011 |
5 | 22311300424241440143 |
6 | 250353250133252525 |
7 | 13111106633051333 |
oct | 1276277676520305 |
9 | 208807101237068 |
10 | 48266825343173 |
11 | 14419933657948 |
12 | 54b6526194145 |
13 | 20c1707cbb068 |
14 | bcc1abd82b53 |
15 | 58a7e6b73268 |
hex | 2be5fefaa0c5 |
48266825343173 has 4 divisors (see below), whose sum is σ = 48350476687500. Its totient is φ = 48183173998848.
The previous prime is 48266825343157. The next prime is 48266825343193. The reversal of 48266825343173 is 37134352866284.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46977562744324 + 1289262598849 = 6854018^2 + 1135457^2 .
It is a cyclic number.
It is not a de Polignac number, because 48266825343173 - 24 = 48266825343157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48266825343193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41825671298 + ... + 41825672451.
It is an arithmetic number, because the mean of its divisors is an integer number (12087619171875).
Almost surely, 248266825343173 is an apocalyptic number.
It is an amenable number.
48266825343173 is a deficient number, since it is larger than the sum of its proper divisors (83651344327).
48266825343173 is an equidigital number, since it uses as much as digits as its factorization.
48266825343173 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83651344326.
The product of its digits is 139345920, while the sum is 62.
The spelling of 48266825343173 in words is "forty-eight trillion, two hundred sixty-six billion, eight hundred twenty-five million, three hundred forty-three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •