Base | Representation |
---|---|
bin | 100110110100011011000000… |
… | …0110001000000100001011101 |
3 | 1122202222220112111100210021010 |
4 | 1031220312000301000201131 |
5 | 324223410103431031031 |
6 | 3210114514545325433 |
7 | 131631256540561662 |
oct | 11550660061004135 |
9 | 1582886474323233 |
10 | 341456355330141 |
11 | 99886910920497 |
12 | 32368642636879 |
13 | 1186b271c1322c |
14 | 604680bd13a69 |
15 | 29720e3ea6246 |
hex | 1368d80c4085d |
341456355330141 has 32 divisors (see below), whose sum is σ = 481921491456000. Its totient is φ = 214448655800448.
The previous prime is 341456355330133. The next prime is 341456355330161. The reversal of 341456355330141 is 141033553654143.
It is not a de Polignac number, because 341456355330141 - 23 = 341456355330133 is a prime.
It is a super-2 number, since 2×3414563553301412 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (341456355330161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 812040436 + ... + 812460818.
It is an arithmetic number, because the mean of its divisors is an integer number (15060046608000).
Almost surely, 2341456355330141 is an apocalyptic number.
It is an amenable number.
341456355330141 is a deficient number, since it is larger than the sum of its proper divisors (140465136125859).
341456355330141 is a wasteful number, since it uses less digits than its factorization.
341456355330141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500193.
The product of its (nonzero) digits is 3888000, while the sum is 48.
The spelling of 341456355330141 in words is "three hundred forty-one trillion, four hundred fifty-six billion, three hundred fifty-five million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •