Base | Representation |
---|---|
bin | 1100000111010110000100… |
… | …1000111010010111111111 |
3 | 1202011102002020022201201122 |
4 | 3001311201020322113333 |
5 | 3221220010231423403 |
6 | 44155134432501155 |
7 | 2543235012666644 |
oct | 301654110722777 |
9 | 52142066281648 |
10 | 13320323311103 |
11 | 4276132281476 |
12 | 15b16993aa7bb |
13 | 758141161ca3 |
14 | 3409c836ddcb |
15 | 18175b177838 |
hex | c1d6123a5ff |
13320323311103 has 4 divisors (see below), whose sum is σ = 13320493051488. Its totient is φ = 13320153570720.
The previous prime is 13320323311091. The next prime is 13320323311111. The reversal of 13320323311103 is 30111332302331.
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 13320323311103 - 230 = 13319249569279 is a prime.
It is a super-2 number, since 2×133203233111032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320323311403) 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, 84752426 + ... + 84909447.
It is an arithmetic number, because the mean of its divisors is an integer number (3330123262872).
Almost surely, 213320323311103 is an apocalyptic number.
13320323311103 is a deficient number, since it is larger than the sum of its proper divisors (169740385).
13320323311103 is an equidigital number, since it uses as much as digits as its factorization.
13320323311103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169740384.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13320323311103 its reverse (30111332302331), we get a palindrome (43431655613434).
The spelling of 13320323311103 in words is "thirteen trillion, three hundred twenty billion, three hundred twenty-three million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •