Base | Representation |
---|---|
bin | 1011111111111110… |
… | …0110100000000111 |
3 | 22022111002220100221 |
4 | 2333333212200013 |
5 | 23044101333111 |
6 | 1251343445211 |
7 | 142552035262 |
oct | 27777464007 |
9 | 8274086327 |
10 | 3221121031 |
11 | 14032699a7 |
12 | 75a8b6807 |
13 | 3c445529b |
14 | 227b25cd9 |
15 | 13cbc1371 |
hex | bffe6807 |
3221121031 has 4 divisors (see below), whose sum is σ = 3332194200. Its totient is φ = 3110047864.
The previous prime is 3221121023. The next prime is 3221121067. The reversal of 3221121031 is 1301211223.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3221121031 - 23 = 3221121023 is a prime.
It is a super-2 number, since 2×32211210312 = 20751241392701005922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3221120996 and 3221121014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3221121331) 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, 55536541 + ... + 55536598.
It is an arithmetic number, because the mean of its divisors is an integer number (833048550).
Almost surely, 23221121031 is an apocalyptic number.
3221121031 is a deficient number, since it is larger than the sum of its proper divisors (111073169).
3221121031 is a wasteful number, since it uses less digits than its factorization.
3221121031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111073168.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 3221121031 is about 56754.9207646350. The cubic root of 3221121031 is about 1476.8475984945.
Adding to 3221121031 its reverse (1301211223), we get a palindrome (4522332254).
The spelling of 3221121031 in words is "three billion, two hundred twenty-one million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •