Base | Representation |
---|---|
bin | 1011111011000111110000… |
… | …1110011101100101111001 |
3 | 1201102100001001020100212111 |
4 | 2332301330032131211321 |
5 | 3204244421013302101 |
6 | 43514444434212321 |
7 | 2522122026211522 |
oct | 276617416354571 |
9 | 51370031210774 |
10 | 13110324353401 |
11 | 41a506a348370 |
12 | 1578a511240a1 |
13 | 7413b542bbc2 |
14 | 33478631b849 |
15 | 17b069e9e251 |
hex | bec7c39d979 |
13110324353401 has 8 divisors (see below), whose sum is σ = 14305730709600. Its totient is φ = 11915511111840.
The previous prime is 13110324353363. The next prime is 13110324353407. The reversal of 13110324353401 is 10435342301131.
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 13110324353401 - 221 = 13110322256249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13110324353407) 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, 148232436 + ... + 148320853.
It is an arithmetic number, because the mean of its divisors is an integer number (1788216338700).
Almost surely, 213110324353401 is an apocalyptic number.
13110324353401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13110324353401 is a deficient number, since it is larger than the sum of its proper divisors (1195406356199).
13110324353401 is a wasteful number, since it uses less digits than its factorization.
13110324353401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296557319.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 13110324353401 its reverse (10435342301131), we get a palindrome (23545666654532).
The spelling of 13110324353401 in words is "thirteen trillion, one hundred ten billion, three hundred twenty-four million, three hundred fifty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •