Base | Representation |
---|---|
bin | 10001000100100… |
… | …111000000111100 |
3 | 201221221200211010 |
4 | 101010213000330 |
5 | 1041310433202 |
6 | 44230555220 |
7 | 10045352541 |
oct | 2104470074 |
9 | 657850733 |
10 | 286421052 |
11 | 13774a415 |
12 | 7bb08b10 |
13 | 47455218 |
14 | 2a07abc8 |
15 | 1a22a76c |
hex | 1112703c |
286421052 has 72 divisors (see below), whose sum is σ = 701496432. Its totient is φ = 90944000.
The previous prime is 286421041. The next prime is 286421053. The reversal of 286421052 is 250124682.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (286421053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1019152 + ... + 1019432.
It is an arithmetic number, because the mean of its divisors is an integer number (9743006).
Almost surely, 2286421052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 286421052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (350748216).
286421052 is an abundant number, since it is smaller than the sum of its proper divisors (415075380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
286421052 is a wasteful number, since it uses less digits than its factorization.
286421052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447 (or 416 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 286421052 is about 16923.9786102441. The cubic root of 286421052 is about 659.1763923064.
The spelling of 286421052 in words is "two hundred eighty-six million, four hundred twenty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •