Base | Representation |
---|---|
bin | 101110101001010111011… |
… | …110011111100011111001 |
3 | 102100102222201122021001002 |
4 | 232221113132133203321 |
5 | 410004342340323301 |
6 | 10452331544534345 |
7 | 450406414516634 |
oct | 56512736374371 |
9 | 12312881567032 |
10 | 3205513214201 |
11 | 10264a5707351 |
12 | 4392bba813b5 |
13 | 1a338110b5ac |
14 | b120d2b0c1b |
15 | 585b1be816b |
hex | 2ea5779f8f9 |
3205513214201 has 16 divisors (see below), whose sum is σ = 3362566238208. Its totient is φ = 3052214054400.
The previous prime is 3205513214179. The next prime is 3205513214213. The reversal of 3205513214201 is 1024123155023.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3205513214201 is a prime.
It is a super-2 number, since 2×32055132142012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3205513217201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2859785 + ... + 3819606.
It is an arithmetic number, because the mean of its divisors is an integer number (210160389888).
Almost surely, 23205513214201 is an apocalyptic number.
3205513214201 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3205513214201 is a deficient number, since it is larger than the sum of its proper divisors (157053024007).
3205513214201 is a wasteful number, since it uses less digits than its factorization.
3205513214201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6679672.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 3205513214201 its reverse (1024123155023), we get a palindrome (4229636369224).
The spelling of 3205513214201 in words is "three trillion, two hundred five billion, five hundred thirteen million, two hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •