Base | Representation |
---|---|
bin | 1011001111101… |
… | …0001011000100 |
3 | 10021202002011200 |
4 | 2303322023010 |
5 | 44033141202 |
6 | 4402502500 |
7 | 1111604460 |
oct | 263721304 |
9 | 107662150 |
10 | 47162052 |
11 | 24692603 |
12 | 13964a30 |
13 | 9a03752 |
14 | 63994a0 |
15 | 4218e1c |
hex | 2cfa2c4 |
47162052 has 144 divisors (see below), whose sum is σ = 145367040. Its totient is φ = 12602304.
The previous prime is 47162041. The next prime is 47162053. The reversal of 47162052 is 25026174.
47162052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (47162053) 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 47 ways as a sum of consecutive naturals, for example, 457833 + ... + 457935.
Almost surely, 247162052 is an apocalyptic number.
47162052 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47162052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72683520).
47162052 is an abundant number, since it is smaller than the sum of its proper divisors (98204988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47162052 is a wasteful number, since it uses less digits than its factorization.
47162052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222 (or 217 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 47162052 is about 6867.4632871243. The cubic root of 47162052 is about 361.2968964074.
The spelling of 47162052 in words is "forty-seven million, one hundred sixty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •