Base | Representation |
---|---|
bin | 100000000110111001111101… |
… | …011111010101000000010101 |
3 | 200111222201221212120020111111 |
4 | 200012321331133111000111 |
5 | 122002104224232404024 |
6 | 1220155525441135021 |
7 | 41513142665243545 |
oct | 4006717537250025 |
9 | 614881855506444 |
10 | 141212040122389 |
11 | 40aa3765293505 |
12 | 13a07a0a62a471 |
13 | 60a431356a382 |
14 | 26c29b08b9325 |
15 | 114d3b1220a94 |
hex | 806e7d7d5015 |
141212040122389 has 2 divisors, whose sum is σ = 141212040122390. Its totient is φ = 141212040122388.
The previous prime is 141212040122369. The next prime is 141212040122407. The reversal of 141212040122389 is 983221040212141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113197726071364 + 28014314051025 = 10639442^2 + 5292855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141212040122389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141212040122369) 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 as a sum of consecutive naturals, namely, 70606020061194 + 70606020061195.
It is an arithmetic number, because the mean of its divisors is an integer number (70606020061195).
Almost surely, 2141212040122389 is an apocalyptic number.
It is an amenable number.
141212040122389 is a deficient number, since it is larger than the sum of its proper divisors (1).
141212040122389 is an equidigital number, since it uses as much as digits as its factorization.
141212040122389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 40.
The spelling of 141212040122389 in words is "one hundred forty-one trillion, two hundred twelve billion, forty million, one hundred twenty-two thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •