Base | Representation |
---|---|
bin | 1001111011100100101… |
… | …10111001101000001101 |
3 | 1012121202021112220211211 |
4 | 10331302112321220031 |
5 | 21042310040202341 |
6 | 420431010414421 |
7 | 33436526555602 |
oct | 4756226715015 |
9 | 1177667486754 |
10 | 341221022221 |
11 | 12179040a412 |
12 | 5616a291411 |
13 | 2623bb56111 |
14 | 1272d9526a9 |
15 | 8d21485181 |
hex | 4f725b9a0d |
341221022221 has 4 divisors (see below), whose sum is σ = 341311320000. Its totient is φ = 341130724444.
The previous prime is 341221022123. The next prime is 341221022239. The reversal of 341221022221 is 122220122143.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 341221022221 - 29 = 341221021709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 341221022192 and 341221022201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (341221022621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45143221 + ... + 45150778.
It is an arithmetic number, because the mean of its divisors is an integer number (85327830000).
Almost surely, 2341221022221 is an apocalyptic number.
It is an amenable number.
341221022221 is a deficient number, since it is larger than the sum of its proper divisors (90297779).
341221022221 is an equidigital number, since it uses as much as digits as its factorization.
341221022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90297778.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 341221022221 its reverse (122220122143), we get a palindrome (463441144364).
The spelling of 341221022221 in words is "three hundred forty-one billion, two hundred twenty-one million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •