Base | Representation |
---|---|
bin | 1011011011000… |
… | …1010000100111 |
3 | 10100011011212121 |
4 | 2312301100213 |
5 | 44231140400 |
6 | 4430530411 |
7 | 1121150026 |
oct | 266612047 |
9 | 110134777 |
10 | 47911975 |
11 | 25054a81 |
12 | 14066a07 |
13 | 9c06ba7 |
14 | 65128bd |
15 | 431621a |
hex | 2db1427 |
47911975 has 12 divisors (see below), whose sum is σ = 59549760. Its totient is φ = 38240000.
The previous prime is 47911961. The next prime is 47911979. The reversal of 47911975 is 57911974.
47911975 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 47911975 - 25 = 47911943 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47911979) 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 11 ways as a sum of consecutive naturals, for example, 9975 + ... + 13975.
It is an arithmetic number, because the mean of its divisors is an integer number (4962480).
Almost surely, 247911975 is an apocalyptic number.
47911975 is a deficient number, since it is larger than the sum of its proper divisors (11637785).
47911975 is a wasteful number, since it uses less digits than its factorization.
47911975 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4490 (or 4485 counting only the distinct ones).
The product of its digits is 79380, while the sum is 43.
The square root of 47911975 is about 6921.8476579595. The cubic root of 47911975 is about 363.2018270162.
Subtracting 47911975 from its reverse (57911974), we obtain a palindrome (9999999).
It can be divided in two parts, 479 and 11975, that multiplied together give a square (5736025 = 23952).
The spelling of 47911975 in words is "forty-seven million, nine hundred eleven thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •