Base | Representation |
---|---|
bin | 1011111011101111111010… |
… | …1000010011110111111011 |
3 | 1201110100212011110201111221 |
4 | 2332323332220103313323 |
5 | 3204434004114231021 |
6 | 43523430122532511 |
7 | 2522653066443241 |
oct | 276737650236773 |
9 | 51410764421457 |
10 | 13121102102011 |
11 | 41a96a0085422 |
12 | 157ab5a667137 |
13 | 7424122ab147 |
14 | 3350c9896791 |
15 | 17b49b28b241 |
hex | beefea13dfb |
13121102102011 has 8 divisors (see below), whose sum is σ = 13145507020800. Its totient is φ = 13096718417640.
The previous prime is 13121102101979. The next prime is 13121102102057. The reversal of 13121102102011 is 11020120112131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13121102102011 - 25 = 13121102101979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13121102102071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4071355 + ... + 6543556.
It is an arithmetic number, because the mean of its divisors is an integer number (1643188377600).
Almost surely, 213121102102011 is an apocalyptic number.
13121102102011 is a deficient number, since it is larger than the sum of its proper divisors (24404918789).
13121102102011 is a wasteful number, since it uses less digits than its factorization.
13121102102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10617209.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 13121102102011 its reverse (11020120112131), we get a palindrome (24141222214142).
The spelling of 13121102102011 in words is "thirteen trillion, one hundred twenty-one billion, one hundred two million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •