Base | Representation |
---|---|
bin | 1011110101000001110… |
… | …1010000110000101111 |
3 | 201102112021200210112210 |
4 | 2331100131100300233 |
5 | 11312140101423043 |
6 | 233204354301503 |
7 | 20452546433502 |
oct | 2752035206057 |
9 | 642467623483 |
10 | 203213311023 |
11 | 79200686348 |
12 | 33473887893 |
13 | 16216c6b648 |
14 | 9b9ab73139 |
15 | 5445601633 |
hex | 2f50750c2f |
203213311023 has 8 divisors (see below), whose sum is σ = 271176690736. Its totient is φ = 135362736000.
The previous prime is 203213310977. The next prime is 203213311039. The reversal of 203213311023 is 320113312302.
203213311023 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 203213311023 - 28 = 203213310767 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203213311123) 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, 28196968 + ... + 28204173.
It is an arithmetic number, because the mean of its divisors is an integer number (33897086342).
Almost surely, 2203213311023 is an apocalyptic number.
203213311023 is a deficient number, since it is larger than the sum of its proper divisors (67963379713).
203213311023 is a wasteful number, since it uses less digits than its factorization.
203213311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56402345.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 203213311023 its reverse (320113312302), we get a palindrome (523326623325).
The spelling of 203213311023 in words is "two hundred three billion, two hundred thirteen million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •