Base | Representation |
---|---|
bin | 11000100101100101… |
… | …00000101110011111 |
3 | 1021001221101020100200 |
4 | 30102302200232133 |
5 | 204013213224043 |
6 | 10021500354543 |
7 | 645053164560 |
oct | 142262405637 |
9 | 37057336320 |
10 | 13200133023 |
11 | 5664149350 |
12 | 2684845a53 |
13 | 13249a46cc |
14 | 8d3184167 |
15 | 523cd57d3 |
hex | 312ca0b9f |
13200133023 has 24 divisors (see below), whose sum is σ = 23771669376. Its totient is φ = 6857211600.
The previous prime is 13200133019. The next prime is 13200133039. The reversal of 13200133023 is 32033100231.
13200133023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13200133023 - 22 = 13200133019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13200132987 and 13200133005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200131023) 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 23 ways as a sum of consecutive naturals, for example, 9523213 + ... + 9524598.
It is an arithmetic number, because the mean of its divisors is an integer number (990486224).
Almost surely, 213200133023 is an apocalyptic number.
13200133023 is a deficient number, since it is larger than the sum of its proper divisors (10571536353).
13200133023 is a wasteful number, since it uses less digits than its factorization.
13200133023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19047835 (or 19047832 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 13200133023 its reverse (32033100231), we get a palindrome (45233233254).
The spelling of 13200133023 in words is "thirteen billion, two hundred million, one hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •