Base | Representation |
---|---|
bin | 1011010011010… |
… | …0100010101101 |
3 | 10022012020010112 |
4 | 2310310202231 |
5 | 44113314013 |
6 | 4411545405 |
7 | 1113621503 |
oct | 264644255 |
9 | 108166115 |
10 | 47401133 |
11 | 2483619a |
12 | 13a5b265 |
13 | 9a88510 |
14 | 641c673 |
15 | 4264ba8 |
hex | 2d348ad |
47401133 has 16 divisors (see below), whose sum is σ = 52662960. Its totient is φ = 42392064.
The previous prime is 47401111. The next prime is 47401141. The reversal of 47401133 is 33110474.
47401133 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 8 ways, for example, as 11377129 + 36024004 = 3373^2 + 6002^2 .
It is not a de Polignac number, because 47401133 - 210 = 47400109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47401099 and 47401108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47401153) 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 15 ways as a sum of consecutive naturals, for example, 60935 + ... + 61707.
It is an arithmetic number, because the mean of its divisors is an integer number (3291435).
Almost surely, 247401133 is an apocalyptic number.
It is an amenable number.
47401133 is a deficient number, since it is larger than the sum of its proper divisors (5261827).
47401133 is a wasteful number, since it uses less digits than its factorization.
47401133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 47401133 is about 6884.8480738503. The cubic root of 47401133 is about 361.9063812730.
The spelling of 47401133 in words is "forty-seven million, four hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •