Base | Representation |
---|---|
bin | 1011111100011101000110… |
… | …1001011000011101010111 |
3 | 1201111112011112121010210022 |
4 | 2333013101221120131113 |
5 | 3210133324432410403 |
6 | 43533153523215355 |
7 | 2523562511505353 |
oct | 277072151303527 |
9 | 51445145533708 |
10 | 13133232310103 |
11 | 4203855290294 |
12 | 1581384b1755b |
13 | 7435c6402079 |
14 | 33591a8ca463 |
15 | 17b95b17bd38 |
hex | bf1d1a58757 |
13133232310103 has 4 divisors (see below), whose sum is σ = 13135317287400. Its totient is φ = 13131147332808.
The previous prime is 13133232310091. The next prime is 13133232310147. The reversal of 13133232310103 is 30101323233131.
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 13133232310103 - 26 = 13133232310039 is a prime.
It is a super-2 number, since 2×131332323101032 (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 (13133232312103) 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, 1042479200 + ... + 1042491797.
It is an arithmetic number, because the mean of its divisors is an integer number (3283829321850).
Almost surely, 213133232310103 is an apocalyptic number.
13133232310103 is a deficient number, since it is larger than the sum of its proper divisors (2084977297).
13133232310103 is an equidigital number, since it uses as much as digits as its factorization.
13133232310103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2084977296.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13133232310103 its reverse (30101323233131), we get a palindrome (43234555543234).
The spelling of 13133232310103 in words is "thirteen trillion, one hundred thirty-three billion, two hundred thirty-two million, three hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •