Base | Representation |
---|---|
bin | 10000001100110101111… |
… | …011100010100011010100 |
3 | 10221102121212212100102111 |
4 | 100030311323202203110 |
5 | 121220020120031012 |
6 | 2211235451120404 |
7 | 143301434111455 |
oct | 20146573424324 |
9 | 3842555770374 |
10 | 1113301330132 |
11 | 39a16a639212 |
12 | 15b922443104 |
13 | 80ca3722314 |
14 | 3bc53c7112c |
15 | 1de5d5c5ba7 |
hex | 10335ee28d4 |
1113301330132 has 6 divisors (see below), whose sum is σ = 1948277327738. Its totient is φ = 556650665064.
The previous prime is 1113301330117. The next prime is 1113301330159. The reversal of 1113301330132 is 2310331033111.
It can be written as a sum of positive squares in only one way, i.e., 1097201780676 + 16099549456 = 1047474^2 + 126884^2 .
It is a super-2 number, since 2×11133013301322 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 139162666263 + ... + 139162666270.
Almost surely, 21113301330132 is an apocalyptic number.
It is an amenable number.
1113301330132 is a deficient number, since it is larger than the sum of its proper divisors (834975997606).
1113301330132 is a wasteful number, since it uses less digits than its factorization.
1113301330132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278325332537 (or 278325332535 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1113301330132 its reverse (2310331033111), we get a palindrome (3423632363243).
The spelling of 1113301330132 in words is "one trillion, one hundred thirteen billion, three hundred one million, three hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •