Base | Representation |
---|---|
bin | 100000000101100101010010… |
… | …010110010011011110001111 |
3 | 200111200001021122010021012121 |
4 | 200011211102112103132033 |
5 | 121444112024214221221 |
6 | 1220050052022513411 |
7 | 41503443650200363 |
oct | 4005452226233617 |
9 | 614601248107177 |
10 | 141121122023311 |
11 | 40a6914a3a8a51 |
12 | 139b2276295867 |
13 | 6098884485601 |
14 | 26bc427aad2a3 |
15 | 114ad3e48ea41 |
hex | 80595259378f |
141121122023311 has 16 divisors (see below), whose sum is σ = 143683099316064. Its totient is φ = 138572571101184.
The previous prime is 141121122023281. The next prime is 141121122023317. The reversal of 141121122023311 is 113320221121141.
It is a cyclic number.
It is not a de Polignac number, because 141121122023311 - 215 = 141121121990543 is a prime.
It is a super-2 number, since 2×1411211220233112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141121122023317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1116109951 + ... + 1116236383.
It is an arithmetic number, because the mean of its divisors is an integer number (8980193707254).
Almost surely, 2141121122023311 is an apocalyptic number.
141121122023311 is a deficient number, since it is larger than the sum of its proper divisors (2561977292753).
141121122023311 is a wasteful number, since it uses less digits than its factorization.
141121122023311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179370.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 141121122023311 its reverse (113320221121141), we get a palindrome (254441343144452).
The spelling of 141121122023311 in words is "one hundred forty-one trillion, one hundred twenty-one billion, one hundred twenty-two million, twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •