Base | Representation |
---|---|
bin | 101100100010000011… |
… | …001100100000010001 |
3 | 11120102101001120010121 |
4 | 230202003030200101 |
5 | 1240411332400444 |
6 | 33544420430241 |
7 | 3311631320512 |
oct | 544203144021 |
9 | 146371046117 |
10 | 47815903249 |
11 | 19307915914 |
12 | 9325548381 |
13 | 4680418b9a |
14 | 2458632a09 |
15 | 139cc6a084 |
hex | b220cc811 |
47815903249 has 4 divisors (see below), whose sum is σ = 47820992436. Its totient is φ = 47810814064.
The previous prime is 47815903231. The next prime is 47815903273. The reversal of 47815903249 is 94230951874.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94230951874 = 2 ⋅47115475937.
It can be written as a sum of positive squares in 2 ways, for example, as 35191133649 + 12624769600 = 187593^2 + 112360^2 .
It is a cyclic number.
It is not a de Polignac number, because 47815903249 - 215 = 47815870481 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47815903196 and 47815903205.
It is not an unprimeable number, because it can be changed into a prime (47815903549) 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, 2530474 + ... + 2549299.
It is an arithmetic number, because the mean of its divisors is an integer number (11955248109).
Almost surely, 247815903249 is an apocalyptic number.
It is an amenable number.
47815903249 is a deficient number, since it is larger than the sum of its proper divisors (5089187).
47815903249 is an equidigital number, since it uses as much as digits as its factorization.
47815903249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5089186.
The product of its (nonzero) digits is 2177280, while the sum is 52.
The spelling of 47815903249 in words is "forty-seven billion, eight hundred fifteen million, nine hundred three thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •