Base | Representation |
---|---|
bin | 1100000110111011001010… |
… | …1110001101110110010111 |
3 | 1202010201102222100201012202 |
4 | 3001232302232031312113 |
5 | 3221110213120010403 |
6 | 44151542113235115 |
7 | 2542561036542545 |
oct | 301566256156627 |
9 | 52121388321182 |
10 | 13313102110103 |
11 | 4273067084264 |
12 | 15b0202b62a9b |
13 | 75756008aaa3 |
14 | 3405012b2d95 |
15 | 181487217688 |
hex | c1bb2b8dd97 |
13313102110103 has 4 divisors (see below), whose sum is σ = 13564292716008. Its totient is φ = 13061911504200.
The previous prime is 13313102110069. The next prime is 13313102110109. The reversal of 13313102110103 is 30101120131331.
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 13313102110103 - 26 = 13313102110039 is a prime.
It is a super-2 number, since 2×133131021101032 (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 (13313102110109) 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, 125595302873 + ... + 125595302978.
It is an arithmetic number, because the mean of its divisors is an integer number (3391073179002).
Almost surely, 213313102110103 is an apocalyptic number.
13313102110103 is a deficient number, since it is larger than the sum of its proper divisors (251190605905).
13313102110103 is an equidigital number, since it uses as much as digits as its factorization.
13313102110103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251190605904.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 13313102110103 its reverse (30101120131331), we get a palindrome (43414222241434).
The spelling of 13313102110103 in words is "thirteen trillion, three hundred thirteen billion, one hundred two million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •