Base | Representation |
---|---|
bin | 1100001100101001101111… |
… | …1000110010111100011011 |
3 | 1202111010102201110211000202 |
4 | 3003022123320302330123 |
5 | 3224213224313132243 |
6 | 44305054243252415 |
7 | 2552643360511055 |
oct | 303123370627433 |
9 | 52433381424022 |
10 | 13411503255323 |
11 | 4300871a50078 |
12 | 16072a537a10b |
13 | 763912575ac4 |
14 | 345197c5a8d5 |
15 | 183ce5dcc4b8 |
hex | c329be32f1b |
13411503255323 has 4 divisors (see below), whose sum is σ = 13638816869880. Its totient is φ = 13184189640768.
The previous prime is 13411503255253. The next prime is 13411503255331. The reversal of 13411503255323 is 32355230511431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13411503255323 - 28 = 13411503255067 is a prime.
It is a super-2 number, since 2×134115032553232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13411503251323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113656807190 + ... + 113656807307.
It is an arithmetic number, because the mean of its divisors is an integer number (3409704217470).
Almost surely, 213411503255323 is an apocalyptic number.
13411503255323 is a deficient number, since it is larger than the sum of its proper divisors (227313614557).
13411503255323 is an equidigital number, since it uses as much as digits as its factorization.
13411503255323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227313614556.
The product of its (nonzero) digits is 162000, while the sum is 38.
Adding to 13411503255323 its reverse (32355230511431), we get a palindrome (45766733766754).
The spelling of 13411503255323 in words is "thirteen trillion, four hundred eleven billion, five hundred three million, two hundred fifty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •