Base | Representation |
---|---|
bin | 11110000010101001011… |
… | …00100100110010101101 |
3 | 10122200022201002120210211 |
4 | 33001110230210302231 |
5 | 113402433024402341 |
6 | 2110105301302421 |
7 | 134401126526161 |
oct | 17012454446255 |
9 | 3580281076724 |
10 | 1032213122221 |
11 | 368839441456 |
12 | 148072104a11 |
13 | 76450007cc8 |
14 | 37d60786ca1 |
15 | 1bcb4800181 |
hex | f054b24cad |
1032213122221 has 16 divisors (see below), whose sum is σ = 1071383459328. Its totient is φ = 993420288000.
The previous prime is 1032213122197. The next prime is 1032213122249. The reversal of 1032213122221 is 1222213122301.
It is a cyclic number.
It is not a de Polignac number, because 1032213122221 - 211 = 1032213120173 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1032213122192 and 1032213122201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032213122321) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 5887021 + ... + 6059821.
It is an arithmetic number, because the mean of its divisors is an integer number (66961466208).
Almost surely, 21032213122221 is an apocalyptic number.
It is an amenable number.
1032213122221 is a deficient number, since it is larger than the sum of its proper divisors (39170337107).
1032213122221 is a wasteful number, since it uses less digits than its factorization.
1032213122221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173892.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1032213122221 its reverse (1222213122301), we get a palindrome (2254426244522).
The spelling of 1032213122221 in words is "one trillion, thirty-two billion, two hundred thirteen million, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •