Base | Representation |
---|---|
bin | 100000000011110100100111… |
… | …011101101001100101011001 |
3 | 200111020111000102120200200120 |
4 | 200003310213131221211121 |
5 | 121440121243210204223 |
6 | 1215514323252023453 |
7 | 41461631666222106 |
oct | 4003644735514531 |
9 | 614214012520616 |
10 | 141000143444313 |
11 | 40a21909120a5a |
12 | 13992932901b89 |
13 | 608a34462121a |
14 | 26b662c7d3aad |
15 | 1147b0d639be3 |
hex | 803d27769959 |
141000143444313 has 8 divisors (see below), whose sum is σ = 188000398608288. Its totient is φ = 93999991954944.
The previous prime is 141000143444257. The next prime is 141000143444353. The reversal of 141000143444313 is 313444341000141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141000143444313 - 28 = 141000143444057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141000143444353) 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 7 ways as a sum of consecutive naturals, for example, 22687720 + ... + 28226457.
It is an arithmetic number, because the mean of its divisors is an integer number (23500049826036).
Almost surely, 2141000143444313 is an apocalyptic number.
It is an amenable number.
141000143444313 is a deficient number, since it is larger than the sum of its proper divisors (47000255163975).
141000143444313 is an equidigital number, since it uses as much as digits as its factorization.
141000143444313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51837303.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 141000143444313 its reverse (313444341000141), we get a palindrome (454444484444454).
The spelling of 141000143444313 in words is "one hundred forty-one trillion, one hundred forty-three million, four hundred forty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •