Base | Representation |
---|---|
bin | 101110100100010110000… |
… | …110000011011100000101 |
3 | 102022221001221211201101002 |
4 | 232210112012003130011 |
5 | 404412322024234341 |
6 | 10450040533543045 |
7 | 450125663264216 |
oct | 56442606033405 |
9 | 12287057751332 |
10 | 3200121321221 |
11 | 1024189071350 |
12 | 4382561a4a85 |
13 | 1a2a02019486 |
14 | b0c5b15940d |
15 | 5839868029b |
hex | 2e916183705 |
3200121321221 has 8 divisors (see below), whose sum is σ = 3674780464800. Its totient is φ = 2756085348240.
The previous prime is 3200121321179. The next prime is 3200121321239. The reversal of 3200121321221 is 1221231210023.
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 3200121321221 - 218 = 3200121059077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3200121321193 and 3200121321202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3200121321251) 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, 7655792426 + ... + 7655792843.
It is an arithmetic number, because the mean of its divisors is an integer number (459347558100).
Almost surely, 23200121321221 is an apocalyptic number.
It is an amenable number.
3200121321221 is a deficient number, since it is larger than the sum of its proper divisors (474659143579).
3200121321221 is a wasteful number, since it uses less digits than its factorization.
3200121321221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15311585299.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 3200121321221 its reverse (1221231210023), we get a palindrome (4421352531244).
The spelling of 3200121321221 in words is "three trillion, two hundred billion, one hundred twenty-one million, three hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •