Base | Representation |
---|---|
bin | 101110101111111000000… |
… | …011000110100110000001 |
3 | 102101010000210112010102222 |
4 | 232233320003012212001 |
5 | 410113201021224441 |
6 | 10455445245420425 |
7 | 451044540404561 |
oct | 56577003064601 |
9 | 12333023463388 |
10 | 3212502133121 |
11 | 10294617825a6 |
12 | 43a73056a715 |
13 | 1a3c26034888 |
14 | b16b3584da1 |
15 | 58870573d4b |
hex | 2ebf80c6981 |
3212502133121 has 8 divisors (see below), whose sum is σ = 3431574378504. Its totient is φ = 2996774502400.
The previous prime is 3212502133111. The next prime is 3212502133133. The reversal of 3212502133121 is 1213312052123.
It can be written as a sum of positive squares in 4 ways, for example, as 62782318096 + 3149719815025 = 250564^2 + 1774745^2 .
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 3212502133121 - 214 = 3212502116737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3212502133111) 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, 836151680 + ... + 836155521.
It is an arithmetic number, because the mean of its divisors is an integer number (428946797313).
Almost surely, 23212502133121 is an apocalyptic number.
It is an amenable number.
3212502133121 is a deficient number, since it is larger than the sum of its proper divisors (219072245383).
3212502133121 is a wasteful number, since it uses less digits than its factorization.
3212502133121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1672307331.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 3212502133121 its reverse (1213312052123), we get a palindrome (4425814185244).
The spelling of 3212502133121 in words is "three trillion, two hundred twelve billion, five hundred two million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •