Base | Representation |
---|---|
bin | 111101100001100… |
… | …111010110101001 |
3 | 2122221022022112221 |
4 | 331201213112221 |
5 | 4103222101441 |
6 | 250232034041 |
7 | 34402512640 |
oct | 7541472651 |
9 | 2587268487 |
10 | 1032222121 |
11 | 48a731837 |
12 | 249832921 |
13 | 135b0c728 |
14 | 9b138357 |
15 | 609488d1 |
hex | 3d8675a9 |
1032222121 has 8 divisors (see below), whose sum is σ = 1191363264. Its totient is φ = 876001200.
The previous prime is 1032222073. The next prime is 1032222187. The reversal of 1032222121 is 1212222301.
It is a happy number.
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 1032222121 - 213 = 1032213929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1032222095 and 1032222104.
It is not an unprimeable number, because it can be changed into a prime (1032222721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 729295 + ... + 730708.
It is an arithmetic number, because the mean of its divisors is an integer number (148920408).
Almost surely, 21032222121 is an apocalyptic number.
It is an amenable number.
1032222121 is a deficient number, since it is larger than the sum of its proper divisors (159141143).
1032222121 is a wasteful number, since it uses less digits than its factorization.
1032222121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1460111.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1032222121 is about 32128.2137847718. The cubic root of 1032222121 is about 1010.6273660037.
Adding to 1032222121 its reverse (1212222301), we get a palindrome (2244444422).
The spelling of 1032222121 in words is "one billion, thirty-two million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •