Base | Representation |
---|---|
bin | 1011010111010… |
… | …0000101101001 |
3 | 10022200110011200 |
4 | 2311310011221 |
5 | 44200131132 |
6 | 4421314413 |
7 | 1116054366 |
oct | 265640551 |
9 | 108613150 |
10 | 47661417 |
11 | 249a3801 |
12 | 13b65a09 |
13 | 9b49b2b |
14 | 648946d |
15 | 42b6d7c |
hex | 2d74169 |
47661417 has 6 divisors (see below), whose sum is σ = 68844282. Its totient is φ = 31774272.
The previous prime is 47661409. The next prime is 47661433. The reversal of 47661417 is 71416674.
47661417 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 43086096 + 4575321 = 6564^2 + 2139^2 .
It is not a de Polignac number, because 47661417 - 23 = 47661409 is a prime.
It is a super-2 number, since 2×476614172 = 4543221340895778, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (47661457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2647848 + ... + 2647865.
It is an arithmetic number, because the mean of its divisors is an integer number (11474047).
Almost surely, 247661417 is an apocalyptic number.
It is an amenable number.
47661417 is a deficient number, since it is larger than the sum of its proper divisors (21182865).
47661417 is a wasteful number, since it uses less digits than its factorization.
47661417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5295719 (or 5295716 counting only the distinct ones).
The product of its digits is 28224, while the sum is 36.
The square root of 47661417 is about 6903.7248641585. The cubic root of 47661417 is about 362.5675929446.
The spelling of 47661417 in words is "forty-seven million, six hundred sixty-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •