Base | Representation |
---|---|
bin | 10111111100000… |
… | …00001000010010 |
3 | 111222211211201000 |
4 | 23332000020102 |
5 | 402401142314 |
6 | 31531522430 |
7 | 4655540001 |
oct | 1376001022 |
9 | 458754630 |
10 | 200802834 |
11 | a3391161 |
12 | 572b9416 |
13 | 327a885b |
14 | 1c950c38 |
15 | 12967209 |
hex | bf80212 |
200802834 has 64 divisors (see below), whose sum is σ = 470292480. Its totient is φ = 63383760.
The previous prime is 200802829. The next prime is 200802853. The reversal of 200802834 is 438208002.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200802798 and 200802807.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 132139 + ... + 133649.
It is an arithmetic number, because the mean of its divisors is an integer number (7348320).
Almost surely, 2200802834 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200802834, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235146240).
200802834 is an abundant number, since it is smaller than the sum of its proper divisors (269489646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200802834 is a wasteful number, since it uses less digits than its factorization.
200802834 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1652 (or 1646 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 200802834 is about 14170.4916640179. The cubic root of 200802834 is about 585.5850032272.
The spelling of 200802834 in words is "two hundred million, eight hundred two thousand, eight hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •