Base | Representation |
---|---|
bin | 101111000010000010010… |
… | …110000001111111101101 |
3 | 102102222100210101011211102 |
4 | 233002002112001333231 |
5 | 410423120032020023 |
6 | 10512432240132445 |
7 | 452335012406060 |
oct | 57020226017755 |
9 | 12388323334742 |
10 | 3232002220013 |
11 | 1036758aa4496 |
12 | 442473007125 |
13 | 1a5a12c87b28 |
14 | b26032d88d7 |
15 | 59112492628 |
hex | 2f082581fed |
3232002220013 has 8 divisors (see below), whose sum is σ = 3694401014400. Its totient is φ = 2769774473520.
The previous prime is 3232002220001. The next prime is 3232002220021. The reversal of 3232002220013 is 3100222002323.
3232002220013 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 3232002220013 - 210 = 3232002218989 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 (3232002520013) 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, 42721478 + ... + 42797063.
It is an arithmetic number, because the mean of its divisors is an integer number (461800126800).
Almost surely, 23232002220013 is an apocalyptic number.
It is an amenable number.
3232002220013 is a deficient number, since it is larger than the sum of its proper divisors (462398794387).
3232002220013 is an equidigital number, since it uses as much as digits as its factorization.
3232002220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85523947.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 3232002220013 its reverse (3100222002323), we get a palindrome (6332224222336).
The spelling of 3232002220013 in words is "three trillion, two hundred thirty-two billion, two million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •