Base | Representation |
---|---|
bin | 101110110111111110100… |
… | …010101110100001010101 |
3 | 102101221111001000102022000 |
4 | 232313332202232201111 |
5 | 410234004430133023 |
6 | 10503444353025513 |
7 | 451503235625013 |
oct | 56677642564125 |
9 | 12357431012260 |
10 | 3221201021013 |
11 | 1032115aaa848 |
12 | 440359855299 |
13 | 1a49b12b7b11 |
14 | b1c9a9b78b3 |
15 | 58bce0c2243 |
hex | 2edfe8ae855 |
3221201021013 has 16 divisors (see below), whose sum is σ = 4799734347840. Its totient is φ = 2135054238192.
The previous prime is 3221201020997. The next prime is 3221201021069. The reversal of 3221201021013 is 3101201021223.
3221201021013 is a `hidden beast` number, since 322 + 120 + 1 + 0 + 210 + 13 = 666.
It is not a de Polignac number, because 3221201021013 - 24 = 3221201020997 is a prime.
It is a super-2 number, since 2×32212010210132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3221201021413) 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, 344803831 + ... + 344813172.
It is an arithmetic number, because the mean of its divisors is an integer number (299983396740).
Almost surely, 23221201021013 is an apocalyptic number.
It is an amenable number.
3221201021013 is a deficient number, since it is larger than the sum of its proper divisors (1578533326827).
3221201021013 is a wasteful number, since it uses less digits than its factorization.
3221201021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689617185 (or 689617179 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 3221201021013 its reverse (3101201021223), we get a palindrome (6322402042236).
The spelling of 3221201021013 in words is "three trillion, two hundred twenty-one billion, two hundred one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •