Base | Representation |
---|---|
bin | 1100000000011010110010… |
… | …1110010110101101101111 |
3 | 1201202000221112210202122020 |
4 | 3000012230232112231233 |
5 | 3212242312034132143 |
6 | 44024335223121223 |
7 | 2531523215243403 |
oct | 300065456265557 |
9 | 51660845722566 |
10 | 13201332333423 |
11 | 422a720a427a3 |
12 | 159260b5a3213 |
13 | 749b5a023660 |
14 | 338d3b043103 |
15 | 17d5e4a86883 |
hex | c01acb96b6f |
13201332333423 has 64 divisors (see below), whose sum is σ = 20254648028160. Its totient is φ = 7580430240768.
The previous prime is 13201332333373. The next prime is 13201332333443. The reversal of 13201332333423 is 32433323310231.
It is not a de Polignac number, because 13201332333423 - 29 = 13201332332911 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13201332333443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 39157765 + ... + 39493457.
It is an arithmetic number, because the mean of its divisors is an integer number (316478875440).
Almost surely, 213201332333423 is an apocalyptic number.
13201332333423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13201332333423 is a deficient number, since it is larger than the sum of its proper divisors (7053315694737).
13201332333423 is a wasteful number, since it uses less digits than its factorization.
13201332333423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336528.
The product of its (nonzero) digits is 69984, while the sum is 33.
Adding to 13201332333423 its reverse (32433323310231), we get a palindrome (45634655643654).
The spelling of 13201332333423 in words is "thirteen trillion, two hundred one billion, three hundred thirty-two million, three hundred thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •