Base | Representation |
---|---|
bin | 100000001000010101011111… |
… | …101011011100100001001111 |
3 | 200112100010122110110020012111 |
4 | 200020111133223130201033 |
5 | 122010212021000331343 |
6 | 1220313022230444451 |
7 | 41523222365340151 |
oct | 4010253753344117 |
9 | 615303573406174 |
10 | 141310324230223 |
11 | 41031410091405 |
12 | 13a22a79803727 |
13 | 60b0677727ab5 |
14 | 26c7655ab8ad1 |
15 | 1150c149b7c9d |
hex | 80855fadc84f |
141310324230223 has 16 divisors (see below), whose sum is σ = 144339732843264. Its totient is φ = 138308693878080.
The previous prime is 141310324230157. The next prime is 141310324230241. The reversal of 141310324230223 is 322032423013141.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141310324230223 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 (141310324237223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23570043 + ... + 28951123.
It is an arithmetic number, because the mean of its divisors is an integer number (9021233302704).
Almost surely, 2141310324230223 is an apocalyptic number.
141310324230223 is a deficient number, since it is larger than the sum of its proper divisors (3029408613041).
141310324230223 is a wasteful number, since it uses less digits than its factorization.
141310324230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5383662.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 141310324230223 its reverse (322032423013141), we get a palindrome (463342747243364).
The spelling of 141310324230223 in words is "one hundred forty-one trillion, three hundred ten billion, three hundred twenty-four million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •