Base | Representation |
---|---|
bin | 100101100001000100010001… |
… | …1010101010110110111110011 |
3 | 1121021102200222001200001022222 |
4 | 1023002020203111112313303 |
5 | 321223210211131202011 |
6 | 3125503542505351255 |
7 | 126336502234302443 |
oct | 11302104325266763 |
9 | 1537380861601288 |
10 | 330000110022131 |
11 | 9616a29602785a |
12 | 3101829519852b |
13 | 11219b52586503 |
14 | 5b6c13a662123 |
15 | 28240d811bddb |
hex | 12c2223556df3 |
330000110022131 has 4 divisors (see below), whose sum is σ = 330069980894952. Its totient is φ = 329930239149312.
The previous prime is 330000110022053. The next prime is 330000110022203. The reversal of 330000110022131 is 131220011000033.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 330000110022131 - 242 = 325602063511027 is a prime.
It is a super-2 number, since 2×3300001100221312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330800110022131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34935429326 + ... + 34935438771.
It is an arithmetic number, because the mean of its divisors is an integer number (82517495223738).
Almost surely, 2330000110022131 is an apocalyptic number.
330000110022131 is a deficient number, since it is larger than the sum of its proper divisors (69870872821).
330000110022131 is an equidigital number, since it uses as much as digits as its factorization.
330000110022131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69870872820.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 330000110022131 its reverse (131220011000033), we get a palindrome (461220121022164).
The spelling of 330000110022131 in words is "three hundred thirty trillion, one hundred ten million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •