Base | Representation |
---|---|
bin | 1000001101101100000… |
… | …0001000111001011111 |
3 | 111111020102101022101002 |
4 | 2003123000020321133 |
5 | 4302444434401343 |
6 | 144454305340515 |
7 | 13123626261002 |
oct | 2033300107137 |
9 | 444212338332 |
10 | 141113200223 |
11 | 549337a4a26 |
12 | 2342263773b |
13 | 103cb3b5058 |
14 | 6b89405539 |
15 | 3a0d8138b8 |
hex | 20db008e5f |
141113200223 has 4 divisors (see below), whose sum is σ = 141255595968. Its totient is φ = 140970804480.
The previous prime is 141113200187. The next prime is 141113200231. The reversal of 141113200223 is 322002311141.
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 141113200223 - 220 = 141112151647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141113200195 and 141113200204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141113200243) 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, 71196386 + ... + 71198367.
It is an arithmetic number, because the mean of its divisors is an integer number (35313898992).
Almost surely, 2141113200223 is an apocalyptic number.
141113200223 is a deficient number, since it is larger than the sum of its proper divisors (142395745).
141113200223 is an equidigital number, since it uses as much as digits as its factorization.
141113200223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142395744.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 141113200223 its reverse (322002311141), we get a palindrome (463115511364).
The spelling of 141113200223 in words is "one hundred forty-one billion, one hundred thirteen million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •