Base | Representation |
---|---|
bin | 1011010010010… |
… | …0101111010001 |
3 | 10022001221100001 |
4 | 2310210233101 |
5 | 44104231101 |
6 | 4410330001 |
7 | 1113232000 |
oct | 264445721 |
9 | 108057301 |
10 | 47336401 |
11 | 247a15a2 |
12 | 13a29901 |
13 | 9a64c08 |
14 | 6402c37 |
15 | 4250901 |
hex | 2d24bd1 |
47336401 has 8 divisors (see below), whose sum is σ = 55203200. Its totient is φ = 40573764.
The previous prime is 47336351. The next prime is 47336437. The reversal of 47336401 is 10463374.
47336401 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 47336401 - 27 = 47336273 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 47336401.
It is not an unprimeable number, because it can be changed into a prime (47336441) 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 7 ways as a sum of consecutive naturals, for example, 68661 + ... + 69346.
It is an arithmetic number, because the mean of its divisors is an integer number (6900400).
Almost surely, 247336401 is an apocalyptic number.
It is an amenable number.
47336401 is a deficient number, since it is larger than the sum of its proper divisors (7866799).
47336401 is an equidigital number, since it uses as much as digits as its factorization.
47336401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138028 (or 138014 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 47336401 is about 6880.1454199748. The cubic root of 47336401 is about 361.7415638619.
Adding to 47336401 its reverse (10463374), we get a palindrome (57799775).
The spelling of 47336401 in words is "forty-seven million, three hundred thirty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •