Base | Representation |
---|---|
bin | 1000001101011000100… |
… | …0001001011011011101 |
3 | 111111000201111010001001 |
4 | 2003112020021123131 |
5 | 4302313020212334 |
6 | 144442224350301 |
7 | 13121614143442 |
oct | 2032610113335 |
9 | 444021433031 |
10 | 141031413469 |
11 | 548a1613371 |
12 | 233bb175391 |
13 | 103b747a61b |
14 | 6b7c5d59c9 |
15 | 3a0655a714 |
hex | 20d62096dd |
141031413469 has 2 divisors, whose sum is σ = 141031413470. Its totient is φ = 141031413468.
The previous prime is 141031413461. The next prime is 141031413473. The reversal of 141031413469 is 964314130141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131312016900 + 9719396569 = 362370^2 + 98587^2 .
It is an emirp because it is prime and its reverse (964314130141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141031413469 - 23 = 141031413461 is a prime.
It is a super-2 number, since 2×1410314134692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141031413461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70515706734 + 70515706735.
It is an arithmetic number, because the mean of its divisors is an integer number (70515706735).
Almost surely, 2141031413469 is an apocalyptic number.
It is an amenable number.
141031413469 is a deficient number, since it is larger than the sum of its proper divisors (1).
141031413469 is an equidigital number, since it uses as much as digits as its factorization.
141031413469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 141031413469 in words is "one hundred forty-one billion, thirty-one million, four hundred thirteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •