Base | Representation |
---|---|
bin | 101110100100010110110… |
… | …011000010010100011001 |
3 | 102022221002210000210210211 |
4 | 232210112303002110121 |
5 | 404412333034104423 |
6 | 10450042034411121 |
7 | 450126165436006 |
oct | 56442663022431 |
9 | 12287083023724 |
10 | 3200133113113 |
11 | 1024194795812 |
12 | 43825a130aa1 |
13 | 1a2a045b7821 |
14 | b0c5c9488ad |
15 | 5839970e10d |
hex | 2e916cc2519 |
3200133113113 has 8 divisors (see below), whose sum is σ = 3307104310016. Its totient is φ = 3093395734800.
The previous prime is 3200133113101. The next prime is 3200133113129. The reversal of 3200133113113 is 3113113310023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3200133113113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3200133113413) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 58426818 + ... + 58481563.
It is an arithmetic number, because the mean of its divisors is an integer number (413388038752).
Almost surely, 23200133113113 is an apocalyptic number.
It is an amenable number.
3200133113113 is a deficient number, since it is larger than the sum of its proper divisors (106971196903).
3200133113113 is a wasteful number, since it uses less digits than its factorization.
3200133113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116909295.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 3200133113113 its reverse (3113113310023), we get a palindrome (6313246423136).
The spelling of 3200133113113 in words is "three trillion, two hundred billion, one hundred thirty-three million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •