Base | Representation |
---|---|
bin | 1010011110000101101010… |
… | …0001100011110111111101 |
3 | 1111202112120020111121122112 |
4 | 2213201122201203313331 |
5 | 3002103114430203123 |
6 | 40252315403023405 |
7 | 2265500601550334 |
oct | 247413241436775 |
9 | 44675506447575 |
10 | 11512031100413 |
11 | 37392524901a8 |
12 | 135b137b0ab65 |
13 | 65676cca544c |
14 | 2bb284590d1b |
15 | 14e6c3652d78 |
hex | a785a863dfd |
11512031100413 has 2 divisors, whose sum is σ = 11512031100414. Its totient is φ = 11512031100412.
The previous prime is 11512031100329. The next prime is 11512031100461. The reversal of 11512031100413 is 31400113021511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7928267855524 + 3583763244889 = 2815718^2 + 1893083^2 .
It is a cyclic number.
It is not a de Polignac number, because 11512031100413 - 212 = 11512031096317 is a prime.
It is a super-2 number, since 2×115120311004132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11512031103413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5756015550206 + 5756015550207.
It is an arithmetic number, because the mean of its divisors is an integer number (5756015550207).
Almost surely, 211512031100413 is an apocalyptic number.
It is an amenable number.
11512031100413 is a deficient number, since it is larger than the sum of its proper divisors (1).
11512031100413 is an equidigital number, since it uses as much as digits as its factorization.
11512031100413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 11512031100413 its reverse (31400113021511), we get a palindrome (42912144121924).
The spelling of 11512031100413 in words is "eleven trillion, five hundred twelve billion, thirty-one million, one hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •