Base | Representation |
---|---|
bin | 1111000110010001111010… |
… | …00001111010100001110011 |
3 | 11100112222220012211000102002 |
4 | 13203020331001322201303 |
5 | 13322431344001011011 |
6 | 154340215014044215 |
7 | 6664462506025052 |
oct | 743107501724163 |
9 | 140488805730362 |
10 | 33201121110131 |
11 | a640575351627 |
12 | 388272434966b |
13 | 156ab106207a0 |
14 | 82ad2b1da399 |
15 | 3c89860e7c3b |
hex | 1e323d07a873 |
33201121110131 has 24 divisors (see below), whose sum is σ = 37738517557104. Its totient is φ = 29032197837120.
The previous prime is 33201121110049. The next prime is 33201121110173. The reversal of 33201121110131 is 13101112110233.
It is not a de Polignac number, because 33201121110131 - 214 = 33201121093747 is a prime.
It is a super-2 number, since 2×332011211101312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (33201121110931) 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 23 ways as a sum of consecutive naturals, for example, 70776005 + ... + 71243561.
It is an arithmetic number, because the mean of its divisors is an integer number (1572438231546).
Almost surely, 233201121110131 is an apocalyptic number.
33201121110131 is a deficient number, since it is larger than the sum of its proper divisors (4537396446973).
33201121110131 is a wasteful number, since it uses less digits than its factorization.
33201121110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482739 (or 482720 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 33201121110131 its reverse (13101112110233), we get a palindrome (46302233220364).
The spelling of 33201121110131 in words is "thirty-three trillion, two hundred one billion, one hundred twenty-one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •