Base | Representation |
---|---|
bin | 1011110101110011001… |
… | …0010000010111010100 |
3 | 201110001200212211221202 |
4 | 2331130302100113110 |
5 | 11313101024003022 |
6 | 233241103332032 |
7 | 20460640445414 |
oct | 2753462202724 |
9 | 643050784852 |
10 | 203420141012 |
11 | 792a7403820 |
12 | 33510bb1018 |
13 | 1624aa7765a |
14 | 9bba412644 |
15 | 5458859592 |
hex | 2f5cc905d4 |
203420141012 has 24 divisors (see below), whose sum is σ = 388755122112. Its totient is φ = 92366657600.
The previous prime is 203420140997. The next prime is 203420141017. The reversal of 203420141012 is 210141024302.
203420141012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203420141017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2383664 + ... + 2467527.
It is an arithmetic number, because the mean of its divisors is an integer number (16198130088).
Almost surely, 2203420141012 is an apocalyptic number.
203420141012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
203420141012 is a deficient number, since it is larger than the sum of its proper divisors (185334981100).
203420141012 is a wasteful number, since it uses less digits than its factorization.
203420141012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852159 (or 4852157 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 203420141012 its reverse (210141024302), we get a palindrome (413561165314).
The spelling of 203420141012 in words is "two hundred three billion, four hundred twenty million, one hundred forty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •