Base | Representation |
---|---|
bin | 1100000111100001001111… |
… | …0100100101001111000101 |
3 | 1202011200211011012100112022 |
4 | 3001320103310211033011 |
5 | 3221242130200301201 |
6 | 44200352121532525 |
7 | 2543402213545616 |
oct | 301702364451705 |
9 | 52150734170468 |
10 | 13323321103301 |
11 | 4277430474090 |
12 | 15b2195344145 |
13 | 7584cb252621 |
14 | 340bd055dc0d |
15 | 18188443241b |
hex | c1e13d253c5 |
13323321103301 has 32 divisors (see below), whose sum is σ = 14833247385600. Its totient is φ = 11865673872000.
The previous prime is 13323321103273. The next prime is 13323321103381. The reversal of 13323321103301 is 10330112332331.
It is a cyclic number.
It is not a de Polignac number, because 13323321103301 - 214 = 13323321086917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13323321103381) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 207849266 + ... + 207913356.
It is an arithmetic number, because the mean of its divisors is an integer number (463538980800).
Almost surely, 213323321103301 is an apocalyptic number.
13323321103301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13323321103301 is a deficient number, since it is larger than the sum of its proper divisors (1509926282299).
13323321103301 is a wasteful number, since it uses less digits than its factorization.
13323321103301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66041.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13323321103301 its reverse (10330112332331), we get a palindrome (23653433435632).
The spelling of 13323321103301 in words is "thirteen trillion, three hundred twenty-three billion, three hundred twenty-one million, one hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •