Base | Representation |
---|---|
bin | 11110110000001001… |
… | …110101111100010011 |
3 | 10011020020012222102110 |
4 | 132300021311330103 |
5 | 1020111124010311 |
6 | 23100320120403 |
7 | 2246161366422 |
oct | 366011657423 |
9 | 104206188373 |
10 | 33020141331 |
11 | 13005010a01 |
12 | 6496466103 |
13 | 3162cac188 |
14 | 18535b52b9 |
15 | cd3d4a8a6 |
hex | 7b0275f13 |
33020141331 has 8 divisors (see below), whose sum is σ = 44036259264. Its totient is φ = 22008725480.
The previous prime is 33020141317. The next prime is 33020141339. The reversal of 33020141331 is 13314102033.
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 33020141331 - 217 = 33020010259 is a prime.
It is a super-2 number, since 2×330201413312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33020141298 and 33020141307.
It is not an unprimeable number, because it can be changed into a prime (33020141339) 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 7 ways as a sum of consecutive naturals, for example, 1159101 + ... + 1187246.
It is an arithmetic number, because the mean of its divisors is an integer number (5504532408).
Almost surely, 233020141331 is an apocalyptic number.
33020141331 is a deficient number, since it is larger than the sum of its proper divisors (11016117933).
33020141331 is a wasteful number, since it uses less digits than its factorization.
33020141331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2351041.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 33020141331 its reverse (13314102033), we get a palindrome (46334243364).
The spelling of 33020141331 in words is "thirty-three billion, twenty million, one hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •