Base | Representation |
---|---|
bin | 1000001111010011001… |
… | …1101000111111010101 |
3 | 111112100121000111022121 |
4 | 2003310303220333111 |
5 | 4304341302201123 |
6 | 145005252455541 |
7 | 13140434160031 |
oct | 2036463507725 |
9 | 445317014277 |
10 | 141546131413 |
11 | 550361125a5 |
12 | 2352361a5b1 |
13 | 10469cb685b |
14 | 6bcaadd1c1 |
15 | 3a3682e75d |
hex | 20f4ce8fd5 |
141546131413 has 2 divisors, whose sum is σ = 141546131414. Its totient is φ = 141546131412.
The previous prime is 141546131369. The next prime is 141546131431. The reversal of 141546131413 is 314131645141.
Together with next prime (141546131431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122876188369 + 18669943044 = 350537^2 + 136638^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141546131413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141546131443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70773065706 + 70773065707.
It is an arithmetic number, because the mean of its divisors is an integer number (70773065707).
Almost surely, 2141546131413 is an apocalyptic number.
It is an amenable number.
141546131413 is a deficient number, since it is larger than the sum of its proper divisors (1).
141546131413 is an equidigital number, since it uses as much as digits as its factorization.
141546131413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17280, while the sum is 34.
Adding to 141546131413 its reverse (314131645141), we get a palindrome (455677776554).
The spelling of 141546131413 in words is "one hundred forty-one billion, five hundred forty-six million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •