Base | Representation |
---|---|
bin | 101110100110001100001… |
… | …001110010000010011011 |
3 | 102100010011222212010121011 |
4 | 232212030021302002123 |
5 | 404430401103310021 |
6 | 10451005250554351 |
7 | 450226033666132 |
oct | 56461411620233 |
9 | 12303158763534 |
10 | 3202102010011 |
11 | 1025005119133 |
12 | 4387095989b7 |
13 | 1a2c59491a88 |
14 | b0da8228919 |
15 | 584624cade1 |
hex | 2e98c27209b |
3202102010011 has 4 divisors (see below), whose sum is σ = 3221276273712. Its totient is φ = 3182927746312.
The previous prime is 3202102009969. The next prime is 3202102010071. The reversal of 3202102010011 is 1100102012023.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3202102010011 - 211 = 3202102007963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3202102009973 and 3202102010000.
It is not an unprimeable number, because it can be changed into a prime (3202102010071) 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 3 ways as a sum of consecutive naturals, for example, 9587131600 + ... + 9587131933.
It is an arithmetic number, because the mean of its divisors is an integer number (805319068428).
Almost surely, 23202102010011 is an apocalyptic number.
3202102010011 is a deficient number, since it is larger than the sum of its proper divisors (19174263701).
3202102010011 is a wasteful number, since it uses less digits than its factorization.
3202102010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19174263700.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 3202102010011 its reverse (1100102012023), we get a palindrome (4302204022034).
The spelling of 3202102010011 in words is "three trillion, two hundred two billion, one hundred two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •