Base | Representation |
---|---|
bin | 1011110100110000010… |
… | …1111111100001001111 |
3 | 201102100011221101221202 |
4 | 2331030011333201033 |
5 | 11312012331232343 |
6 | 233153221220115 |
7 | 20451000243662 |
oct | 2751405774117 |
9 | 642304841852 |
10 | 203140102223 |
11 | 79173323503 |
12 | 3345326163b |
13 | 16204a48426 |
14 | 9b911576d9 |
15 | 543de8edb8 |
hex | 2f4c17f84f |
203140102223 has 8 divisors (see below), whose sum is σ = 203780286528. Its totient is φ = 202500787104.
The previous prime is 203140102181. The next prime is 203140102229. The reversal of 203140102223 is 322201041302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 203140102223 - 212 = 203140098127 is a prime.
It is a super-2 number, since 2×2031401022232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203140102195 and 203140102204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203140102229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 252461 + ... + 685577.
It is an arithmetic number, because the mean of its divisors is an integer number (25472535816).
Almost surely, 2203140102223 is an apocalyptic number.
203140102223 is a deficient number, since it is larger than the sum of its proper divisors (640184305).
203140102223 is a wasteful number, since it uses less digits than its factorization.
203140102223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 434593.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 203140102223 its reverse (322201041302), we get a palindrome (525341143525).
The spelling of 203140102223 in words is "two hundred three billion, one hundred forty million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •