Base | Representation |
---|---|
bin | 1001011110001011110000… |
… | …0010100011011000101101 |
3 | 1100212120202101220002212000 |
4 | 2113202330002203120231 |
5 | 2331111142302330331 |
6 | 34052110315002513 |
7 | 2123253324166551 |
oct | 227427402433055 |
9 | 40776671802760 |
10 | 10414155511341 |
11 | 335568932061a |
12 | 12023bb739439 |
13 | 5a708738407a |
14 | 2800952c9861 |
15 | 130d6943c0e6 |
hex | 978bc0a362d |
10414155511341 has 8 divisors (see below), whose sum is σ = 15428378535360. Its totient is φ = 6942770340876.
The previous prime is 10414155511327. The next prime is 10414155511351. The reversal of 10414155511341 is 14311555141401.
10414155511341 is a `hidden beast` number, since 1 + 0 + 41 + 4 + 15 + 551 + 13 + 41 = 666.
It is a de Polignac number, because none of the positive numbers 2k-10414155511341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10414155511296 and 10414155511305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10414155511321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192854731665 + ... + 192854731718.
It is an arithmetic number, because the mean of its divisors is an integer number (1928547316920).
Almost surely, 210414155511341 is an apocalyptic number.
It is an amenable number.
10414155511341 is a deficient number, since it is larger than the sum of its proper divisors (5014223024019).
10414155511341 is an equidigital number, since it uses as much as digits as its factorization.
10414155511341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385709463392 (or 385709463386 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 36.
The spelling of 10414155511341 in words is "ten trillion, four hundred fourteen billion, one hundred fifty-five million, five hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •