Base | Representation |
---|---|
bin | 1011110111111011001101… |
… | …0001110101111000001111 |
3 | 1201020002022012121111012202 |
4 | 2331332303101311320033 |
5 | 3202344441313130333 |
6 | 43433324002152115 |
7 | 2515136213001452 |
oct | 275766321657017 |
9 | 51202265544182 |
10 | 13055413411343 |
11 | 4183851575916 |
12 | 156a28765263b |
13 | 739174112804 |
14 | 331c576ad499 |
15 | 1799043e55e8 |
hex | bdfb3475e0f |
13055413411343 has 8 divisors (see below), whose sum is σ = 13302524008800. Its totient is φ = 12808331778528.
The previous prime is 13055413411289. The next prime is 13055413411393. The reversal of 13055413411343 is 34311431455031.
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 13055413411343 - 26 = 13055413411279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13055413411297 and 13055413411306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13055413411393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6330083 + ... + 8135156.
It is an arithmetic number, because the mean of its divisors is an integer number (1662815501100).
Almost surely, 213055413411343 is an apocalyptic number.
13055413411343 is a deficient number, since it is larger than the sum of its proper divisors (247110597457).
13055413411343 is a wasteful number, since it uses less digits than its factorization.
13055413411343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14482321.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 13055413411343 its reverse (34311431455031), we get a palindrome (47366844866374).
The spelling of 13055413411343 in words is "thirteen trillion, fifty-five billion, four hundred thirteen million, four hundred eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •