Base | Representation |
---|---|
bin | 1011110101000001110… |
… | …0001010011111111111 |
3 | 201102112021011011202211 |
4 | 2331100130022133333 |
5 | 11312140013220411 |
6 | 233204344201251 |
7 | 20452544124451 |
oct | 2752034123777 |
9 | 642467134684 |
10 | 203213023231 |
11 | 792004aa0a9 |
12 | 33473769227 |
13 | 16216b9a65a |
14 | 9b9aada2d1 |
15 | 5445596221 |
hex | 2f5070a7ff |
203213023231 has 8 divisors (see below), whose sum is σ = 207143035344. Its totient is φ = 199320619200.
The previous prime is 203213023217. The next prime is 203213023253. The reversal of 203213023231 is 132320312302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203213023231 is a prime.
It is a super-2 number, since 2×2032130232312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203213023271) 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 7 ways as a sum of consecutive naturals, for example, 9391110 + ... + 9412723.
It is an arithmetic number, because the mean of its divisors is an integer number (25892879418).
Almost surely, 2203213023231 is an apocalyptic number.
203213023231 is a deficient number, since it is larger than the sum of its proper divisors (3930012113).
203213023231 is a wasteful number, since it uses less digits than its factorization.
203213023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18804041.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 203213023231 its reverse (132320312302), we get a palindrome (335533335533).
The spelling of 203213023231 in words is "two hundred three billion, two hundred thirteen million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •