Base | Representation |
---|---|
bin | 100000000011111110111100… |
… | …010010010110011100111011 |
3 | 200111021112122002022100201112 |
4 | 200003332330102112130323 |
5 | 121440311444414102024 |
6 | 1215523355340110535 |
7 | 41462503511250404 |
oct | 4003767422263473 |
9 | 614245562270645 |
10 | 141011230222139 |
11 | 40a2658833a262 |
12 | 13994b0783544b |
13 | 608b3c050cca4 |
14 | 26b6da10129ab |
15 | 114805bb1b00e |
hex | 803fbc49673b |
141011230222139 has 2 divisors, whose sum is σ = 141011230222140. Its totient is φ = 141011230222138.
The previous prime is 141011230222133. The next prime is 141011230222169. The reversal of 141011230222139 is 931222032110141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141011230222139 - 24 = 141011230222123 is a prime.
It is a super-2 number, since 2×1410112302221392 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (141011230222133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70505615111069 + 70505615111070.
It is an arithmetic number, because the mean of its divisors is an integer number (70505615111070).
Almost surely, 2141011230222139 is an apocalyptic number.
141011230222139 is a deficient number, since it is larger than the sum of its proper divisors (1).
141011230222139 is an equidigital number, since it uses as much as digits as its factorization.
141011230222139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 141011230222139 in words is "one hundred forty-one trillion, eleven billion, two hundred thirty million, two hundred twenty-two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •