Base | Representation |
---|---|
bin | 101110110111010001001… |
… | …111111100001010000101 |
3 | 102101212112002010112000101 |
4 | 232313101033330022011 |
5 | 410230430411341123 |
6 | 10503241125444101 |
7 | 451445350605205 |
oct | 56672117741205 |
9 | 12355462115011 |
10 | 3220441121413 |
11 | 1031866068a4a |
12 | 440187270631 |
13 | 1a48bca35399 |
14 | b1c27aca405 |
15 | 58b8751baad |
hex | 2edd13fc285 |
3220441121413 has 12 divisors (see below), whose sum is σ = 3401039659680. Its totient is φ = 3048986699496.
The previous prime is 3220441121383. The next prime is 3220441121461. The reversal of 3220441121413 is 3141211440223.
It is a happy number.
It is not a de Polignac number, because 3220441121413 - 213 = 3220441113221 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 (3220441121213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2298295 + ... + 3423892.
It is an arithmetic number, because the mean of its divisors is an integer number (283419971640).
Almost surely, 23220441121413 is an apocalyptic number.
It is an amenable number.
3220441121413 is a deficient number, since it is larger than the sum of its proper divisors (180598538267).
3220441121413 is a wasteful number, since it uses less digits than its factorization.
3220441121413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5723784 (or 5723765 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 3220441121413 its reverse (3141211440223), we get a palindrome (6361652561636).
The spelling of 3220441121413 in words is "three trillion, two hundred twenty billion, four hundred forty-one million, one hundred twenty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •