Base | Representation |
---|---|
bin | 1011001111000… |
… | …1011110111101 |
3 | 10021200021100111 |
4 | 2303301132331 |
5 | 44031021321 |
6 | 4402030021 |
7 | 1111365634 |
oct | 263613675 |
9 | 107607314 |
10 | 47126461 |
11 | 24668898 |
12 | 13948311 |
13 | 99c04a5 |
14 | 638a51b |
15 | 420d5e1 |
hex | 2cf17bd |
47126461 has 4 divisors (see below), whose sum is σ = 47140192. Its totient is φ = 47112732.
The previous prime is 47126459. The next prime is 47126467. The reversal of 47126461 is 16462174.
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 a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 16462174 = 2 ⋅8231087.
It is a cyclic number.
It is not a de Polignac number, because 47126461 - 21 = 47126459 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 (47126467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3370 + ... + 10276.
It is an arithmetic number, because the mean of its divisors is an integer number (11785048).
Almost surely, 247126461 is an apocalyptic number.
It is an amenable number.
47126461 is a deficient number, since it is larger than the sum of its proper divisors (13731).
47126461 is an equidigital number, since it uses as much as digits as its factorization.
47126461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13730.
The product of its digits is 8064, while the sum is 31.
The square root of 47126461 is about 6864.8715210119. The cubic root of 47126461 is about 361.2059888993.
The spelling of 47126461 in words is "forty-seven million, one hundred twenty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •