Base | Representation |
---|---|
bin | 1011111011101111111011… |
… | …0000110110100101011100 |
3 | 1201110100212022200111022001 |
4 | 2332323332300312211130 |
5 | 3204434010202410330 |
6 | 43523430242532044 |
7 | 2522653124461012 |
oct | 276737660664534 |
9 | 51410768614261 |
10 | 13121104341340 |
11 | 41a96a1374906 |
12 | 157ab5b367024 |
13 | 7424128b34a8 |
14 | 3350c9cba8b2 |
15 | 17b49b57e9ca |
hex | beefec3695c |
13121104341340 has 12 divisors (see below), whose sum is σ = 27554319116856. Its totient is φ = 5248441736528.
The previous prime is 13121104341307. The next prime is 13121104341379. The reversal of 13121104341340 is 4314340112131.
It is a junction number, because it is equal to n+sod(n) for n = 13121104341299 and 13121104341308.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 328027608514 + ... + 328027608553.
It is an arithmetic number, because the mean of its divisors is an integer number (2296193259738).
Almost surely, 213121104341340 is an apocalyptic number.
13121104341340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13121104341340 is an abundant number, since it is smaller than the sum of its proper divisors (14433214775516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13121104341340 is a wasteful number, since it uses less digits than its factorization.
13121104341340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 656055217076 (or 656055217074 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 13121104341340 its reverse (4314340112131), we get a palindrome (17435444453471).
The spelling of 13121104341340 in words is "thirteen trillion, one hundred twenty-one billion, one hundred four million, three hundred forty-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •