Base | Representation |
---|---|
bin | 1011111011101111111010… |
… | …1001000110111100101001 |
3 | 1201110100212011212100111000 |
4 | 2332323332221012330221 |
5 | 3204434004142424314 |
6 | 43523430131225213 |
7 | 2522653101304164 |
oct | 276737651067451 |
9 | 51410764770430 |
10 | 13121102311209 |
11 | 41a96a0208612 |
12 | 157ab5a748209 |
13 | 742412352429 |
14 | 3350c990cadb |
15 | 17b49b2cd209 |
hex | beefea46f29 |
13121102311209 has 32 divisors (see below), whose sum is σ = 20284304544000. Its totient is φ = 8366883845760.
The previous prime is 13121102311183. The next prime is 13121102311217. The reversal of 13121102311209 is 90211320112131.
13121102311209 is a `hidden beast` number, since 1 + 31 + 2 + 110 + 2 + 311 + 209 = 666.
It is not a de Polignac number, because 13121102311209 - 27 = 13121102311081 is a prime.
It is a super-2 number, since 2×131211023112092 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13121102311409) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29100517 + ... + 29547965.
It is an arithmetic number, because the mean of its divisors is an integer number (633884517000).
Almost surely, 213121102311209 is an apocalyptic number.
It is an amenable number.
13121102311209 is a deficient number, since it is larger than the sum of its proper divisors (7163202232791).
13121102311209 is a wasteful number, since it uses less digits than its factorization.
13121102311209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494702 (or 494696 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 13121102311209 in words is "thirteen trillion, one hundred twenty-one billion, one hundred two million, three hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •