Base | Representation |
---|---|
bin | 100000000110111001010001… |
… | …110010000111000101001101 |
3 | 200111222200001202210001221121 |
4 | 200012321101302013011031 |
5 | 122002101224023123324 |
6 | 1220155325004400541 |
7 | 41513115552440215 |
oct | 4006712162070515 |
9 | 614880052701847 |
10 | 141211306848589 |
11 | 40aa3419387aaa |
12 | 13a07844b46151 |
13 | 60a422767ab53 |
14 | 26c294135d245 |
15 | 114d36bb795e4 |
hex | 806e51c8714d |
141211306848589 has 2 divisors, whose sum is σ = 141211306848590. Its totient is φ = 141211306848588.
The previous prime is 141211306848569. The next prime is 141211306848737. The reversal of 141211306848589 is 985848603112141.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115311451992489 + 25899854856100 = 10738317^2 + 5089190^2 .
It is a cyclic number.
It is not a de Polignac number, because 141211306848589 - 211 = 141211306846541 is a prime.
It is a super-2 number, since 2×1412113068485892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141211306848569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70605653424294 + 70605653424295.
It is an arithmetic number, because the mean of its divisors is an integer number (70605653424295).
Almost surely, 2141211306848589 is an apocalyptic number.
It is an amenable number.
141211306848589 is a deficient number, since it is larger than the sum of its proper divisors (1).
141211306848589 is an equidigital number, since it uses as much as digits as its factorization.
141211306848589 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13271040, while the sum is 61.
The spelling of 141211306848589 in words is "one hundred forty-one trillion, two hundred eleven billion, three hundred six million, eight hundred forty-eight thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •