Base | Representation |
---|---|
bin | 10111110110000… |
… | …01011000001010 |
3 | 111221101010221020 |
4 | 23323001120022 |
5 | 402201142024 |
6 | 31503053310 |
7 | 4646104050 |
oct | 1373013012 |
9 | 457333836 |
10 | 200021514 |
11 | a29a8140 |
12 | 56ba1236 |
13 | 32594034 |
14 | 1c7ca1d0 |
15 | 12860979 |
hex | bec160a |
200021514 has 64 divisors (see below), whose sum is σ = 500290560. Its totient is φ = 51793920.
The previous prime is 200021513. The next prime is 200021527. The reversal of 200021514 is 415120002.
It is a junction number, because it is equal to n+sod(n) for n = 200021493 and 200021502.
It is not an unprimeable number, because it can be changed into a prime (200021513) 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 31 ways as a sum of consecutive naturals, for example, 259722 + ... + 260490.
It is an arithmetic number, because the mean of its divisors is an integer number (7817040).
Almost surely, 2200021514 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200021514, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (250145280).
200021514 is an abundant number, since it is smaller than the sum of its proper divisors (300269046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200021514 is a wasteful number, since it uses less digits than its factorization.
200021514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 200021514 is about 14142.8962380412. The cubic root of 200021514 is about 584.8245159966.
Adding to 200021514 its reverse (415120002), we get a palindrome (615141516).
The spelling of 200021514 in words is "two hundred million, twenty-one thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •