Base | Representation |
---|---|
bin | 11111111000100000111110… |
… | …100001011011111010101111 |
3 | 200101111012102210211121222111 |
4 | 133320200332201123322233 |
5 | 121334403443123413203 |
6 | 1214121342150024451 |
7 | 41351534105334463 |
oct | 3770407641337257 |
9 | 611435383747874 |
10 | 140223141232303 |
11 | 40752333685818 |
12 | 13888226348127 |
13 | 6031ca713ac2c |
14 | 268ab9c9424a3 |
15 | 11327d436c26d |
hex | 7f883e85beaf |
140223141232303 has 32 divisors (see below), whose sum is σ = 146315321118720. Its totient is φ = 134282708440320.
The previous prime is 140223141232301. The next prime is 140223141232319. The reversal of 140223141232303 is 303232141322041.
It is a cyclic number.
It is not a de Polignac number, because 140223141232303 - 21 = 140223141232301 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 (140223141232301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1729593258 + ... + 1729674328.
It is an arithmetic number, because the mean of its divisors is an integer number (4572353784960).
Almost surely, 2140223141232303 is an apocalyptic number.
140223141232303 is a deficient number, since it is larger than the sum of its proper divisors (6092179886417).
140223141232303 is a wasteful number, since it uses less digits than its factorization.
140223141232303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84087.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 140223141232303 its reverse (303232141322041), we get a palindrome (443455282554344).
The spelling of 140223141232303 in words is "one hundred forty trillion, two hundred twenty-three billion, one hundred forty-one million, two hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •