Base | Representation |
---|---|
bin | 1011110100101110011… |
… | …1110110100000111110 |
3 | 201102022122001222112200 |
4 | 2331023213312200332 |
5 | 11312003320413042 |
6 | 233152340012330 |
7 | 20450543135262 |
oct | 2751347664076 |
9 | 642278058480 |
10 | 203132201022 |
11 | 79169917193 |
12 | 334506910a6 |
13 | 1620320cc6a |
14 | 9b9009c0a2 |
15 | 543d42dc4c |
hex | 2f4b9f683e |
203132201022 has 24 divisors (see below), whose sum is σ = 441345743280. Its totient is φ = 67522122240.
The previous prime is 203132201003. The next prime is 203132201029. The reversal of 203132201022 is 220102231302.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 203132200986 and 203132201004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203132201029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15710979 + ... + 15723902.
It is an arithmetic number, because the mean of its divisors is an integer number (18389405970).
Almost surely, 2203132201022 is an apocalyptic number.
203132201022 is an abundant number, since it is smaller than the sum of its proper divisors (238213542258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203132201022 is a wasteful number, since it uses less digits than its factorization.
203132201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31435248 (or 31435245 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 203132201022 its reverse (220102231302), we get a palindrome (423234432324).
The spelling of 203132201022 in words is "two hundred three billion, one hundred thirty-two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •