Base | Representation |
---|---|
bin | 1011111010101100100001… |
… | …0101000101000111111011 |
3 | 1201101122011101021210120100 |
4 | 2332223020111011013323 |
5 | 3204134431333101021 |
6 | 43511235032330443 |
7 | 2521442555501664 |
oct | 276531025050773 |
9 | 51348141253510 |
10 | 13103011222011 |
11 | 41a1a57270527 |
12 | 157754bb43a23 |
13 | 7407bb2ab219 |
14 | 334290d7036b |
15 | 17ac8ce30626 |
hex | beac85451fb |
13103011222011 has 12 divisors (see below), whose sum is σ = 18946431768888. Its totient is φ = 8726174659104.
The previous prime is 13103011222009. The next prime is 13103011222013. The reversal of 13103011222011 is 11022211030131.
13103011222011 is a `hidden beast` number, since 1 + 310 + 30 + 1 + 122 + 201 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (13103011222009) and next prime (13103011222013).
It is not a de Polignac number, because 13103011222011 - 21 = 13103011222009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13103011222013) 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, 763837245 + ... + 763854398.
It is an arithmetic number, because the mean of its divisors is an integer number (1578869314074).
Almost surely, 213103011222011 is an apocalyptic number.
13103011222011 is a deficient number, since it is larger than the sum of its proper divisors (5843420546877).
13103011222011 is a wasteful number, since it uses less digits than its factorization.
13103011222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1527692602 (or 1527692599 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13103011222011 its reverse (11022211030131), we get a palindrome (24125222252142).
The spelling of 13103011222011 in words is "thirteen trillion, one hundred three billion, eleven million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •