Base | Representation |
---|---|
bin | 101110110000101000111… |
… | …100010000100010001101 |
3 | 102101012010222001010210212 |
4 | 232300220330100202031 |
5 | 410121341020004123 |
6 | 10500102511212205 |
7 | 451104060633545 |
oct | 56605074204215 |
9 | 12335128033725 |
10 | 3213322422413 |
11 | 1029842811034 |
12 | 43a91b217065 |
13 | 1a4026c6c75c |
14 | b17504b2325 |
15 | 588bc5a7878 |
hex | 2ec28f1088d |
3213322422413 has 8 divisors (see below), whose sum is σ = 3281835906432. Its totient is φ = 3144814976896.
The previous prime is 3213322422353. The next prime is 3213322422419. The reversal of 3213322422413 is 3142242233123.
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 3213322422413 - 28 = 3213322422157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3213322422413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3213322422419) 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, 425795 + ... + 2570592.
It is an arithmetic number, because the mean of its divisors is an integer number (410229488304).
Almost surely, 23213322422413 is an apocalyptic number.
It is an amenable number.
3213322422413 is a deficient number, since it is larger than the sum of its proper divisors (68513484019).
3213322422413 is a wasteful number, since it uses less digits than its factorization.
3213322422413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3019251.
The product of its digits is 41472, while the sum is 32.
Adding to 3213322422413 its reverse (3142242233123), we get a palindrome (6355564655536).
The spelling of 3213322422413 in words is "three trillion, two hundred thirteen billion, three hundred twenty-two million, four hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •