Base | Representation |
---|---|
bin | 11110110100111011… |
… | …101100110101111001 |
3 | 10011102211002111001021 |
4 | 132310323230311321 |
5 | 1020242140220441 |
6 | 23112302422441 |
7 | 2251154036011 |
oct | 366473546571 |
9 | 104384074037 |
10 | 33100320121 |
11 | 130462a4470 |
12 | 64b9291a21 |
13 | 31767a2a4b |
14 | 18600c6c41 |
15 | cdadd73d1 |
hex | 7b4eecd79 |
33100320121 has 16 divisors (see below), whose sum is σ = 38265696000. Its totient is φ = 28344937600.
The previous prime is 33100320089. The next prime is 33100320151. The reversal of 33100320121 is 12102300133.
It is a cyclic number.
It is not a de Polignac number, because 33100320121 - 25 = 33100320089 is a prime.
It is a super-2 number, since 2×331003201212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33100320095 and 33100320104.
It is not an unprimeable number, because it can be changed into a prime (33100320151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1252321 + ... + 1278478.
It is an arithmetic number, because the mean of its divisors is an integer number (2391606000).
Almost surely, 233100320121 is an apocalyptic number.
It is an amenable number.
33100320121 is a deficient number, since it is larger than the sum of its proper divisors (5165375879).
33100320121 is a wasteful number, since it uses less digits than its factorization.
33100320121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2530880.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 33100320121 its reverse (12102300133), we get a palindrome (45202620254).
The spelling of 33100320121 in words is "thirty-three billion, one hundred million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •