Base | Representation |
---|---|
bin | 10000000001100100110… |
… | …001000001101010010001 |
3 | 10220021101200012220210100 |
4 | 100001210301001222101 |
5 | 121020230230414413 |
6 | 2201515120523013 |
7 | 142362550161261 |
oct | 20014461015221 |
9 | 3807350186710 |
10 | 1101202201233 |
11 | 395020a30632 |
12 | 159506480469 |
13 | 7cac5b90654 |
14 | 3b42700b7a1 |
15 | 1d9a12c3a73 |
hex | 10064c41a91 |
1101202201233 has 12 divisors (see below), whose sum is σ = 1590728602320. Its totient is φ = 734087169816.
The previous prime is 1101202201223. The next prime is 1101202201259. The reversal of 1101202201233 is 3321022021011.
1101202201233 is a `hidden beast` number, since 110 + 120 + 2 + 201 + 233 = 666.
It is not a de Polignac number, because 1101202201233 - 24 = 1101202201217 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1101202201223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3822543 + ... + 4100516.
It is an arithmetic number, because the mean of its divisors is an integer number (132560716860).
Almost surely, 21101202201233 is an apocalyptic number.
It is an amenable number.
1101202201233 is a deficient number, since it is larger than the sum of its proper divisors (489526401087).
1101202201233 is a wasteful number, since it uses less digits than its factorization.
1101202201233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7938508 (or 7938505 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1101202201233 its reverse (3321022021011), we get a palindrome (4422224222244).
The spelling of 1101202201233 in words is "one trillion, one hundred one billion, two hundred two million, two hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •