Base | Representation |
---|---|
bin | 1011110100101100010… |
… | …0110111110010101101 |
3 | 201102021222211002221010 |
4 | 2331023010313302231 |
5 | 11311443443444323 |
6 | 233151411255433 |
7 | 20450402164164 |
oct | 2751304676255 |
9 | 642258732833 |
10 | 203123031213 |
11 | 79164723833 |
12 | 334495aa579 |
13 | 1620134c23b |
14 | 9b8cb923db |
15 | 543c71bc93 |
hex | 2f4b137cad |
203123031213 has 4 divisors (see below), whose sum is σ = 270830708288. Its totient is φ = 135415354140.
The previous prime is 203123031203. The next prime is 203123031229. The reversal of 203123031213 is 312130321302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 203123031213 - 212 = 203123027117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 203123031213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203123031203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33853838533 + ... + 33853838538.
It is an arithmetic number, because the mean of its divisors is an integer number (67707677072).
Almost surely, 2203123031213 is an apocalyptic number.
It is an amenable number.
203123031213 is a deficient number, since it is larger than the sum of its proper divisors (67707677075).
203123031213 is an equidigital number, since it uses as much as digits as its factorization.
203123031213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67707677074.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 203123031213 its reverse (312130321302), we get a palindrome (515253352515).
The spelling of 203123031213 in words is "two hundred three billion, one hundred twenty-three million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •