Base | Representation |
---|---|
bin | 1100000000010110010101… |
… | …0000000110111010000111 |
3 | 1201201220211222110121000220 |
4 | 3000011211100012322013 |
5 | 3212232333101101043 |
6 | 44024020230035423 |
7 | 2531451415045656 |
oct | 300054520067207 |
9 | 51656758417026 |
10 | 13200133222023 |
11 | 422a166093640 |
12 | 1592335aa8b73 |
13 | 7499c8780797 |
14 | 338c65aa519d |
15 | 17d574674483 |
hex | c0165406e87 |
13200133222023 has 16 divisors (see below), whose sum is σ = 19224284397696. Its totient is φ = 7990042982240.
The previous prime is 13200133222021. The next prime is 13200133222063. The reversal of 13200133222023 is 32022233100231.
It is not a de Polignac number, because 13200133222023 - 21 = 13200133222021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13200133221984 and 13200133222002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200133222021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 250917261 + ... + 250969862.
It is an arithmetic number, because the mean of its divisors is an integer number (1201517774856).
Almost surely, 213200133222023 is an apocalyptic number.
13200133222023 is a deficient number, since it is larger than the sum of its proper divisors (6024151175673).
13200133222023 is a wasteful number, since it uses less digits than its factorization.
13200133222023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501887934.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13200133222023 its reverse (32022233100231), we get a palindrome (45222366322254).
The spelling of 13200133222023 in words is "thirteen trillion, two hundred billion, one hundred thirty-three million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •