Base | Representation |
---|---|
bin | 1100000111011000111101… |
… | …1100111011101000111111 |
3 | 1202011111002101101102100102 |
4 | 3001312033130323220333 |
5 | 3221223103134423403 |
6 | 44155343510351315 |
7 | 2543263166251034 |
oct | 301661734735077 |
9 | 52144071342312 |
10 | 13321100311103 |
11 | 42764a0933032 |
12 | 15b187565b53b |
13 | 7582361210c0 |
14 | 340a5d62d38b |
15 | 1817a44a9b88 |
hex | c1d8f73ba3f |
13321100311103 has 8 divisors (see below), whose sum is σ = 14346962769888. Its totient is φ = 12295403914464.
The previous prime is 13321100311097. The next prime is 13321100311111. The reversal of 13321100311103 is 30111300112331.
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 13321100311103 - 24 = 13321100311087 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 (13321100311403) 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, 41348900 + ... + 41669817.
It is an arithmetic number, because the mean of its divisors is an integer number (1793370346236).
Almost surely, 213321100311103 is an apocalyptic number.
13321100311103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13321100311103 is a deficient number, since it is larger than the sum of its proper divisors (1025862458785).
13321100311103 is a wasteful number, since it uses less digits than its factorization.
13321100311103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83031073.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 13321100311103 its reverse (30111300112331), we get a palindrome (43432400423434).
The spelling of 13321100311103 in words is "thirteen trillion, three hundred twenty-one billion, one hundred million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •