Base | Representation |
---|---|
bin | 101110100101010001110… |
… | …000001100001110100101 |
3 | 102100000122201012210111211 |
4 | 232211101300030032211 |
5 | 404421344242114023 |
6 | 10450324130431421 |
7 | 450162535642231 |
oct | 56452160141645 |
9 | 12300581183454 |
10 | 3201122223013 |
11 | 1024652050710 |
12 | 438495432571 |
13 | 1a2b314b0c60 |
14 | b0d1405d5c1 |
15 | 5840648da0d |
hex | 2e951c0c3a5 |
3201122223013 has 8 divisors (see below), whose sum is σ = 3760758975456. Its totient is φ = 2686256410800.
The previous prime is 3201122223011. The next prime is 3201122223077. The reversal of 3201122223013 is 3103222211023.
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 3201122223013 - 21 = 3201122223011 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 (3201122223011) 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 7 ways as a sum of consecutive naturals, for example, 11192734903 + ... + 11192735188.
It is an arithmetic number, because the mean of its divisors is an integer number (470094871932).
Almost surely, 23201122223013 is an apocalyptic number.
It is an amenable number.
3201122223013 is a deficient number, since it is larger than the sum of its proper divisors (559636752443).
3201122223013 is a wasteful number, since it uses less digits than its factorization.
3201122223013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22385470115.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 3201122223013 its reverse (3103222211023), we get a palindrome (6304344434036).
The spelling of 3201122223013 in words is "three trillion, two hundred one billion, one hundred twenty-two million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •