Base | Representation |
---|---|
bin | 11110000100010011001… |
… | …00101000101000000101 |
3 | 10122202121112100111022210 |
4 | 33002021210220220011 |
5 | 113411242124430341 |
6 | 2110333311214033 |
7 | 134432121043500 |
oct | 17021144505005 |
9 | 3582545314283 |
10 | 1033100233221 |
11 | 369154170041 |
12 | 14827b217319 |
13 | 76561a3ab64 |
14 | 3800650a137 |
15 | 1bd17632c16 |
hex | f089928a05 |
1033100233221 has 48 divisors (see below), whose sum is σ = 1621724328000. Its totient is φ = 583219752192.
The previous prime is 1033100233213. The next prime is 1033100233229. The reversal of 1033100233221 is 1223320013301.
It is an interprime number because it is at equal distance from previous prime (1033100233213) and next prime (1033100233229).
It is not a de Polignac number, because 1033100233221 - 23 = 1033100233213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1033100233229) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15837130 + ... + 15902228.
It is an arithmetic number, because the mean of its divisors is an integer number (33785923500).
Almost surely, 21033100233221 is an apocalyptic number.
It is an amenable number.
1033100233221 is a deficient number, since it is larger than the sum of its proper divisors (588624094779).
1033100233221 is a wasteful number, since it uses less digits than its factorization.
1033100233221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66418 (or 66411 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1033100233221 its reverse (1223320013301), we get a palindrome (2256420246522).
The spelling of 1033100233221 in words is "one trillion, thirty-three billion, one hundred million, two hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •