Base | Representation |
---|---|
bin | 1011110100010010010… |
… | …1000010100000110111 |
3 | 201102000101200221002011 |
4 | 2331010211002200313 |
5 | 11311233042220343 |
6 | 233132515025051 |
7 | 20444606503504 |
oct | 2750445024067 |
9 | 642011627064 |
10 | 203014023223 |
11 | 7910913a490 |
12 | 33418b9b187 |
13 | 161b48a357b |
14 | 9b7c4d84ab |
15 | 5432d8829d |
hex | 2f44942837 |
203014023223 has 4 divisors (see below), whose sum is σ = 221469843528. Its totient is φ = 184558202920.
The previous prime is 203014023209. The next prime is 203014023337. The reversal of 203014023223 is 322320410302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 203014023223 - 29 = 203014022711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203014023194 and 203014023203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203014026223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9227910136 + ... + 9227910157.
It is an arithmetic number, because the mean of its divisors is an integer number (55367460882).
Almost surely, 2203014023223 is an apocalyptic number.
203014023223 is a deficient number, since it is larger than the sum of its proper divisors (18455820305).
203014023223 is a wasteful number, since it uses less digits than its factorization.
203014023223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18455820304.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 203014023223 its reverse (322320410302), we get a palindrome (525334433525).
The spelling of 203014023223 in words is "two hundred three billion, fourteen million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •