Base | Representation |
---|---|
bin | 101110100100010000110… |
… | …101100001100111100111 |
3 | 102022220211210211201210001 |
4 | 232210100311201213213 |
5 | 404412131433233221 |
6 | 10450024103042131 |
7 | 450123542400223 |
oct | 56442065414747 |
9 | 12286753751701 |
10 | 3200033102311 |
11 | 1024143297161 |
12 | 438230740347 |
13 | 1a29b996c136 |
14 | b0c4d553783 |
15 | 58390a56391 |
hex | 2e910d619e7 |
3200033102311 has 8 divisors (see below), whose sum is σ = 3217722923520. Its totient is φ = 3182391947448.
The previous prime is 3200033102309. The next prime is 3200033102347. The reversal of 3200033102311 is 1132013300023.
3200033102311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3200033102311 - 21 = 3200033102309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3200033102011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12034711 + ... + 12297736.
It is an arithmetic number, because the mean of its divisors is an integer number (402215365440).
Almost surely, 23200033102311 is an apocalyptic number.
3200033102311 is a deficient number, since it is larger than the sum of its proper divisors (17689821209).
3200033102311 is a wasteful number, since it uses less digits than its factorization.
3200033102311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24333173.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 3200033102311 its reverse (1132013300023), we get a palindrome (4332046402334).
The spelling of 3200033102311 in words is "three trillion, two hundred billion, thirty-three million, one hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •