Base | Representation |
---|---|
bin | 1000001110011011001… |
… | …1001110110001101111 |
3 | 111111202012211211211220 |
4 | 2003212303032301233 |
5 | 4303401123034043 |
6 | 144530100114423 |
7 | 13131551616501 |
oct | 2034663166157 |
9 | 444665754756 |
10 | 141311143023 |
11 | 54a25502316 |
12 | 23478995a13 |
13 | 104303cbb7b |
14 | 6ba780dd71 |
15 | 3a20db3483 |
hex | 20e6ccec6f |
141311143023 has 8 divisors (see below), whose sum is σ = 188567178288. Its totient is φ = 94131268224.
The previous prime is 141311143013. The next prime is 141311143033. The reversal of 141311143023 is 320341113141.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (141311143013) and next prime (141311143033).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141311143023 - 214 = 141311126639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141311142984 and 141311143002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141311143013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19035786 + ... + 19043207.
It is an arithmetic number, because the mean of its divisors is an integer number (23570897286).
Almost surely, 2141311143023 is an apocalyptic number.
141311143023 is a deficient number, since it is larger than the sum of its proper divisors (47256035265).
141311143023 is a wasteful number, since it uses less digits than its factorization.
141311143023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38080233.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 141311143023 its reverse (320341113141), we get a palindrome (461652256164).
The spelling of 141311143023 in words is "one hundred forty-one billion, three hundred eleven million, one hundred forty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •