Base | Representation |
---|---|
bin | 1010000110001… |
… | …00110001010100 |
3 | 12220100210122200 |
4 | 11003010301110 |
5 | 133140121202 |
6 | 12223124500 |
7 | 2045604414 |
oct | 503046124 |
9 | 186323580 |
10 | 84692052 |
11 | 43896435 |
12 | 24443730 |
13 | 14713c53 |
14 | b368644 |
15 | 767de1c |
hex | 50c4c54 |
84692052 has 18 divisors (see below), whose sum is σ = 214082778. Its totient is φ = 28230672.
The previous prime is 84692033. The next prime is 84692053. The reversal of 84692052 is 25029648.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 77369616 + 7322436 = 8796^2 + 2706^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 2352557 = 84692052 / (8 + 4 + 6 + 9 + 2 + 0 + 5 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 84691998 and 84692016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (84692053) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1176243 + ... + 1176314.
Almost surely, 284692052 is an apocalyptic number.
It is an amenable number.
84692052 is an abundant number, since it is smaller than the sum of its proper divisors (129390726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84692052 is a wasteful number, since it uses less digits than its factorization.
84692052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2352567 (or 2352562 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 84692052 is about 9202.8284782452. The cubic root of 84692052 is about 439.1513462981.
The spelling of 84692052 in words is "eighty-four million, six hundred ninety-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •