Base | Representation |
---|---|
bin | 1011110101111100001100… |
… | …1010101011100010111111 |
3 | 1201002211022012021111010111 |
4 | 2331133003022223202333 |
5 | 3201320130434343403 |
6 | 43405524551050451 |
7 | 2512521311516512 |
oct | 275370312534277 |
9 | 51084265244114 |
10 | 13021320231103 |
11 | 41703468949a8 |
12 | 1563751970a27 |
13 | 735b9ca32692 |
14 | 3303417b6d79 |
15 | 178aab28c56d |
hex | bd7c32ab8bf |
13021320231103 has 4 divisors (see below), whose sum is σ = 13108711642200. Its totient is φ = 12933928820008.
The previous prime is 13021320231067. The next prime is 13021320231167. The reversal of 13021320231103 is 30113202312031.
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 13021320231103 - 221 = 13021318133951 is a prime.
It is a super-4 number, since 4×130213202311034 (a number of 54 digits) contains 4444 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 (13021320531103) 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, 43695705325 + ... + 43695705622.
It is an arithmetic number, because the mean of its divisors is an integer number (3277177910550).
Almost surely, 213021320231103 is an apocalyptic number.
13021320231103 is a deficient number, since it is larger than the sum of its proper divisors (87391411097).
13021320231103 is an equidigital number, since it uses as much as digits as its factorization.
13021320231103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87391411096.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13021320231103 its reverse (30113202312031), we get a palindrome (43134522543134).
The spelling of 13021320231103 in words is "thirteen trillion, twenty-one billion, three hundred twenty million, two hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •