Base | Representation |
---|---|
bin | 1011110100110010110… |
… | …0001110000011101001 |
3 | 201102100212210112012120 |
4 | 2331030230032003221 |
5 | 11312022412420431 |
6 | 233154220101453 |
7 | 20451151361532 |
oct | 2751454160351 |
9 | 642325715176 |
10 | 203150123241 |
11 | 79178a4843a |
12 | 33456694889 |
13 | 16206b46720 |
14 | 9b92605689 |
15 | 543ecbe196 |
hex | 2f4cb0e0e9 |
203150123241 has 8 divisors (see below), whose sum is σ = 291702741120. Its totient is φ = 125015460432.
The previous prime is 203150123207. The next prime is 203150123261. The reversal of 203150123241 is 142321051302.
203150123241 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 203150123241 - 26 = 203150123177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (203150123201) 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, 2604488721 + ... + 2604488798.
It is an arithmetic number, because the mean of its divisors is an integer number (36462842640).
Almost surely, 2203150123241 is an apocalyptic number.
It is an amenable number.
203150123241 is a deficient number, since it is larger than the sum of its proper divisors (88552617879).
203150123241 is a wasteful number, since it uses less digits than its factorization.
203150123241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5208977535.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 203150123241 its reverse (142321051302), we get a palindrome (345471174543).
The spelling of 203150123241 in words is "two hundred three billion, one hundred fifty million, one hundred twenty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •