Base | Representation |
---|---|
bin | 101110101111100111010… |
… | …010101011000111101101 |
3 | 102101002022012112012100102 |
4 | 232233213102223013231 |
5 | 410112112034032341 |
6 | 10455401324040445 |
7 | 451034555004140 |
oct | 56574722530755 |
9 | 12332265465312 |
10 | 3212221002221 |
11 | 1029328016810 |
12 | 43a672393125 |
13 | 1a3baca1252a |
14 | b16880c4057 |
15 | 58855a40c9b |
hex | 2ebe74ab1ed |
3212221002221 has 8 divisors (see below), whose sum is σ = 4004846963904. Its totient is φ = 2503029352320.
The previous prime is 3212221002181. The next prime is 3212221002313. The reversal of 3212221002221 is 1222001222123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3212221002221 - 26 = 3212221002157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3212221002193 and 3212221002202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3212221002521) 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, 20858577860 + ... + 20858578013.
It is an arithmetic number, because the mean of its divisors is an integer number (500605870488).
Almost surely, 23212221002221 is an apocalyptic number.
It is an amenable number.
3212221002221 is a deficient number, since it is larger than the sum of its proper divisors (792625961683).
3212221002221 is a wasteful number, since it uses less digits than its factorization.
3212221002221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41717155891.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 3212221002221 its reverse (1222001222123), we get a palindrome (4434222224344).
The spelling of 3212221002221 in words is "three trillion, two hundred twelve billion, two hundred twenty-one million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •