Base | Representation |
---|---|
bin | 100000001000100000011110… |
… | …110101011100011111101101 |
3 | 200112101021002121121010122121 |
4 | 200020200132311130133231 |
5 | 122010410201014000123 |
6 | 1220322253005312541 |
7 | 41524120623251320 |
oct | 4010403665343755 |
9 | 615337077533577 |
10 | 141322121234413 |
11 | 410364141a4249 |
12 | 13a25210565751 |
13 | 60b18077c6852 |
14 | 26c80547747b7 |
15 | 11511a54db75d |
hex | 80881ed5c7ed |
141322121234413 has 16 divisors (see below), whose sum is σ = 163118186208000. Its totient is φ = 119927972592000.
The previous prime is 141322121234279. The next prime is 141322121234417. The reversal of 141322121234413 is 314432121223141.
It is a cyclic number.
It is not a de Polignac number, because 141322121234413 - 221 = 141322119137261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141322121234417) 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 in 15 ways as a sum of consecutive naturals, for example, 9380248 + ... + 19251838.
It is an arithmetic number, because the mean of its divisors is an integer number (10194886638000).
Almost surely, 2141322121234413 is an apocalyptic number.
It is an amenable number.
141322121234413 is a deficient number, since it is larger than the sum of its proper divisors (21796064973587).
141322121234413 is a wasteful number, since it uses less digits than its factorization.
141322121234413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9891948.
The product of its digits is 27648, while the sum is 34.
Adding to 141322121234413 its reverse (314432121223141), we get a palindrome (455754242457554).
The spelling of 141322121234413 in words is "one hundred forty-one trillion, three hundred twenty-two billion, one hundred twenty-one million, two hundred thirty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •