Base | Representation |
---|---|
bin | 1011111111111110… |
… | …0000010110100010 |
3 | 22022111001121211000 |
4 | 2333333200112202 |
5 | 23044100031332 |
6 | 1251343132430 |
7 | 142551601656 |
oct | 27777402642 |
9 | 8274047730 |
10 | 3221095842 |
11 | 1403251a88 |
12 | 75a8a4116 |
13 | 3c4446993 |
14 | 227b1aa66 |
15 | 13cbb8b7c |
hex | bffe05a2 |
3221095842 has 64 divisors (see below), whose sum is σ = 7648819200. Its totient is φ = 1001237760.
The previous prime is 3221095817. The next prime is 3221095877. The reversal of 3221095842 is 2485901223.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 3221095797 and 3221095806.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 83967 + ... + 116157.
It is an arithmetic number, because the mean of its divisors is an integer number (119512800).
Almost surely, 23221095842 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3221095842, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3824409600).
3221095842 is an abundant number, since it is smaller than the sum of its proper divisors (4427723358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3221095842 is a wasteful number, since it uses less digits than its factorization.
3221095842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32328 (or 32322 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 3221095842 is about 56754.6988539275. The cubic root of 3221095842 is about 1476.8437488605.
The spelling of 3221095842 in words is "three billion, two hundred twenty-one million, ninety-five thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •