Base | Representation |
---|---|
bin | 100000000110100001101011… |
… | …011100100100001011001101 |
3 | 200111220020122211112002122011 |
4 | 200012201223130210023031 |
5 | 122001142330201320204 |
6 | 1220135534344421221 |
7 | 41511230615426626 |
oct | 4006415334441315 |
9 | 614806584462564 |
10 | 141185967604429 |
11 | 40a936a6002900 |
12 | 13a02952a77811 |
13 | 60a1a19a86057 |
14 | 26c1619d08a4d |
15 | 114c8872e5304 |
hex | 80686b7242cd |
141185967604429 has 12 divisors (see below), whose sum is σ = 157731945390460. Its totient is φ = 126246766852800.
The previous prime is 141185967604379. The next prime is 141185967604477. The reversal of 141185967604429 is 924406769581141.
It can be written as a sum of positive squares in 2 ways, for example, as 34599959201929 + 106586008402500 = 5882173^2 + 10324050^2 .
It is not a de Polignac number, because 141185967604429 - 27 = 141185967604301 is a prime.
It is a super-2 number, since 2×1411859676044292 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141185967605429) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9564141624 + ... + 9564156385.
Almost surely, 2141185967604429 is an apocalyptic number.
It is an amenable number.
141185967604429 is a deficient number, since it is larger than the sum of its proper divisors (16545977786031).
141185967604429 is a wasteful number, since it uses less digits than its factorization.
141185967604429 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19128298092 (or 19128298081 counting only the distinct ones).
The product of its (nonzero) digits is 104509440, while the sum is 67.
The spelling of 141185967604429 in words is "one hundred forty-one trillion, one hundred eighty-five billion, nine hundred sixty-seven million, six hundred four thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •