Base | Representation |
---|---|
bin | 101101011010101011010… |
… | …011101001101010011101 |
3 | 102001100220021100010012002 |
4 | 231122223103221222131 |
5 | 402113322144442341 |
6 | 10345435452452045 |
7 | 441325535636510 |
oct | 55325323515235 |
9 | 12040807303162 |
10 | 3121020312221 |
11 | aa3687668539 |
12 | 424a5b47a025 |
13 | 1984072169c6 |
14 | ab0b5956d77 |
15 | 562b908e29b |
hex | 2d6ab4e9a9d |
3121020312221 has 8 divisors (see below), whose sum is σ = 3754610902080. Its totient is φ = 2534362358688.
The previous prime is 3121020312217. The next prime is 3121020312229. The reversal of 3121020312221 is 1222130201213.
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 3121020312221 - 22 = 3121020312217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3121020312193 and 3121020312202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3121020312229) 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, 11733158936 + ... + 11733159201.
It is an arithmetic number, because the mean of its divisors is an integer number (469326362760).
Almost surely, 23121020312221 is an apocalyptic number.
It is an amenable number.
3121020312221 is a deficient number, since it is larger than the sum of its proper divisors (633590589859).
3121020312221 is a wasteful number, since it uses less digits than its factorization.
3121020312221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23466318163.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 3121020312221 its reverse (1222130201213), we get a palindrome (4343150513434).
The spelling of 3121020312221 in words is "three trillion, one hundred twenty-one billion, twenty million, three hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •