Base | Representation |
---|---|
bin | 100000001000100001011100… |
… | …010010000011001100001001 |
3 | 200112101100202110102201112022 |
4 | 200020201130102003030021 |
5 | 122010414303422034423 |
6 | 1220322543153254225 |
7 | 41524155311654123 |
oct | 4010413422031411 |
9 | 615340673381468 |
10 | 141323152143113 |
11 | 410368a3109206 |
12 | 13a25459864375 |
13 | 60b19402664b5 |
14 | 26c811164a213 |
15 | 1151215c75dc8 |
hex | 80885c483309 |
141323152143113 has 4 divisors (see below), whose sum is σ = 141329313527700. Its totient is φ = 141316990758528.
The previous prime is 141323152143091. The next prime is 141323152143119. The reversal of 141323152143113 is 311341251323141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15444019692544 + 125879132450569 = 3929888^2 + 11219587^2 .
It is a cyclic number.
It is not a de Polignac number, because 141323152143113 - 246 = 70954407965449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141323152143119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3080657888 + ... + 3080703761.
It is an arithmetic number, because the mean of its divisors is an integer number (35332328381925).
Almost surely, 2141323152143113 is an apocalyptic number.
It is an amenable number.
141323152143113 is a deficient number, since it is larger than the sum of its proper divisors (6161384587).
141323152143113 is an equidigital number, since it uses as much as digits as its factorization.
141323152143113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6161384586.
The product of its digits is 25920, while the sum is 35.
The spelling of 141323152143113 in words is "one hundred forty-one trillion, three hundred twenty-three billion, one hundred fifty-two million, one hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •