Base | Representation |
---|---|
bin | 1100000000011010000011… |
… | …0010111010110100101110 |
3 | 1201202000102121020002201211 |
4 | 3000012200302322310232 |
5 | 3212241404321001220 |
6 | 44024303313425034 |
7 | 2531515235204602 |
oct | 300064062726456 |
9 | 51660377202654 |
10 | 13201132203310 |
11 | 422a628a81007 |
12 | 159257456b17a |
13 | 749b2772207c |
14 | 338d1c629502 |
15 | 17d5d2203b5a |
hex | c01a0cbad2e |
13201132203310 has 64 divisors (see below), whose sum is σ = 25669021409280. Its totient is φ = 4870028782080.
The previous prime is 13201132203289. The next prime is 13201132203379. The reversal of 13201132203310 is 1330223110231.
It is a super-2 number, since 2×132011322033102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 858570 + ... + 5209549.
It is an arithmetic number, because the mean of its divisors is an integer number (401078459520).
Almost surely, 213201132203310 is an apocalyptic number.
13201132203310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13201132203310 is a deficient number, since it is larger than the sum of its proper divisors (12467889205970).
13201132203310 is a wasteful number, since it uses less digits than its factorization.
13201132203310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6068401.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13201132203310 its reverse (1330223110231), we get a palindrome (14531355313541).
The spelling of 13201132203310 in words is "thirteen trillion, two hundred one billion, one hundred thirty-two million, two hundred three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •