Base | Representation |
---|---|
bin | 1011010001011… |
… | …1010100011010 |
3 | 10021222010221020 |
4 | 2310113110122 |
5 | 44101001214 |
6 | 4405223310 |
7 | 1112612514 |
oct | 264272432 |
9 | 107863836 |
10 | 47281434 |
11 | 24764272 |
12 | 13a01b36 |
13 | 9a45ba5 |
14 | 63cabb4 |
15 | 423e4a9 |
hex | 2d1751a |
47281434 has 8 divisors (see below), whose sum is σ = 94562880. Its totient is φ = 15760476.
The previous prime is 47281427. The next prime is 47281441. The reversal of 47281434 is 43418274.
47281434 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (47281427) and next prime (47281441).
It is a sphenic number, since it is the product of 3 distinct primes.
47281434 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 47281395 and 47281404.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3940114 + ... + 3940125.
It is an arithmetic number, because the mean of its divisors is an integer number (11820360).
Almost surely, 247281434 is an apocalyptic number.
47281434 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47281434 is a wasteful number, since it uses less digits than its factorization.
47281434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7880244.
The product of its digits is 21504, while the sum is 33.
The square root of 47281434 is about 6876.1496493314. The cubic root of 47281434 is about 361.6014916028.
The spelling of 47281434 in words is "forty-seven million, two hundred eighty-one thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •