Base | Representation |
---|---|
bin | 1011001110100… |
… | …0010100010001 |
3 | 10021121100211211 |
4 | 2303220110101 |
5 | 44023321123 |
6 | 4401140121 |
7 | 1111151314 |
oct | 263502421 |
9 | 107540754 |
10 | 47088913 |
11 | 24642663 |
12 | 1392a641 |
13 | 99a9381 |
14 | 637a97b |
15 | 420240d |
hex | 2ce8511 |
47088913 has 4 divisors (see below), whose sum is σ = 48184048. Its totient is φ = 45993780.
The previous prime is 47088911. The next prime is 47088919. The reversal of 47088913 is 31988074.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31988074 = 2 ⋅15994037.
It is a cyclic number.
It is not a de Polignac number, because 47088913 - 21 = 47088911 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (47088911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 547503 + ... + 547588.
It is an arithmetic number, because the mean of its divisors is an integer number (12046012).
Almost surely, 247088913 is an apocalyptic number.
47088913 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
47088913 is a deficient number, since it is larger than the sum of its proper divisors (1095135).
47088913 is a wasteful number, since it uses less digits than its factorization.
47088913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095134.
The product of its (nonzero) digits is 48384, while the sum is 40.
The square root of 47088913 is about 6862.1361834344. The cubic root of 47088913 is about 361.1100331399.
The spelling of 47088913 in words is "forty-seven million, eighty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •