Base | Representation |
---|---|
bin | 101110111000001011010010… |
… | …1000001111110100000101111 |
3 | 2000001222102110111201100222200 |
4 | 1131300112211001332200233 |
5 | 413021244040111330221 |
6 | 4020550515455512543 |
7 | 152565442644132126 |
oct | 13560264501764057 |
9 | 2001872414640880 |
10 | 412341104011311 |
11 | 10a42597555a882 |
12 | 3a2b6575528753 |
13 | 149107a3775207 |
14 | 73b75b73daabd |
15 | 32a0e120be426 |
hex | 17705a507e82f |
412341104011311 has 12 divisors (see below), whose sum is σ = 595994889687288. Its totient is φ = 274713574210704.
The previous prime is 412341104011307. The next prime is 412341104011321. The reversal of 412341104011311 is 113110401143214.
412341104011311 is a `hidden beast` number, since 4 + 1 + 2 + 341 + 1 + 0 + 4 + 0 + 1 + 1 + 311 = 666.
It is not a de Polignac number, because 412341104011311 - 22 = 412341104011307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412341104011321) 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, 15041246380 + ... + 15041273793.
It is an arithmetic number, because the mean of its divisors is an integer number (49666240807274).
Almost surely, 2412341104011311 is an apocalyptic number.
412341104011311 is a deficient number, since it is larger than the sum of its proper divisors (183653785675977).
412341104011311 is a wasteful number, since it uses less digits than its factorization.
412341104011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30082521702 (or 30082521699 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
Adding to 412341104011311 its reverse (113110401143214), we get a palindrome (525451505154525).
The spelling of 412341104011311 in words is "four hundred twelve trillion, three hundred forty-one billion, one hundred four million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •