Base | Representation |
---|---|
bin | 1011110100101100100… |
… | …1100010100101001011 |
3 | 201102022002010021201110 |
4 | 2331023021202211023 |
5 | 11311444302130201 |
6 | 233151453421403 |
7 | 20450415452214 |
oct | 2751311424513 |
9 | 642262107643 |
10 | 203124255051 |
11 | 7916538a273 |
12 | 33449a9a863 |
13 | 1620168a2c3 |
14 | 9b8cdd040b |
15 | 543c8ae6d6 |
hex | 2f4b26294b |
203124255051 has 8 divisors (see below), whose sum is σ = 270901996240. Its totient is φ = 135381341952.
The previous prime is 203124255031. The next prime is 203124255079. The reversal of 203124255051 is 150552421302.
203124255051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203124255051 - 231 = 200976771403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203124255011) 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, 8693410 + ... + 8716743.
It is an arithmetic number, because the mean of its divisors is an integer number (33862749530).
Almost surely, 2203124255051 is an apocalyptic number.
203124255051 is a deficient number, since it is larger than the sum of its proper divisors (67777741189).
203124255051 is a wasteful number, since it uses less digits than its factorization.
203124255051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17414045.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 203124255051 its reverse (150552421302), we get a palindrome (353676676353).
The spelling of 203124255051 in words is "two hundred three billion, one hundred twenty-four million, two hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •