Base | Representation |
---|---|
bin | 11000010000100… |
… | …10101110000110 |
3 | 112011220220002200 |
4 | 30020102232012 |
5 | 404044003142 |
6 | 32105415330 |
7 | 5020503456 |
oct | 1410225606 |
9 | 464826080 |
10 | 203500422 |
11 | a4963974 |
12 | 5819a546 |
13 | 33211668 |
14 | 1d053d66 |
15 | 12ceb64c |
hex | c212b86 |
203500422 has 12 divisors (see below), whose sum is σ = 440917620. Its totient is φ = 67833468.
The previous prime is 203500397. The next prime is 203500463. The reversal of 203500422 is 224005302.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 11305579 = 203500422 / (2 + 0 + 3 + 5 + 0 + 0 + 4 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 203500395 and 203500404.
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 5652772 + ... + 5652807.
It is an arithmetic number, because the mean of its divisors is an integer number (36743135).
Almost surely, 2203500422 is an apocalyptic number.
203500422 is an abundant number, since it is smaller than the sum of its proper divisors (237417198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203500422 is a wasteful number, since it uses less digits than its factorization.
203500422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11305587 (or 11305584 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 18.
The square root of 203500422 is about 14265.3574087718. The cubic root of 203500422 is about 588.1955999266.
Adding to 203500422 its reverse (224005302), we get a palindrome (427505724).
The spelling of 203500422 in words is "two hundred three million, five hundred thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •