Base | Representation |
---|---|
bin | 11001101101111111111110… |
… | …010111100001110111001000 |
3 | 112211111102102212211212221222 |
4 | 121231333332113201313020 |
5 | 104311212322204233112 |
6 | 1040323013002021212 |
7 | 32553042352333346 |
oct | 3155777627416710 |
9 | 484442385755858 |
10 | 113112231321032 |
11 | 3304a69a829549 |
12 | 10829aa94a7808 |
13 | 4b1658c677c58 |
14 | 1dd09384cc996 |
15 | d12496da6372 |
hex | 66dffe5e1dc8 |
113112231321032 has 8 divisors (see below), whose sum is σ = 212085433726950. Its totient is φ = 56556115660512.
The previous prime is 113112231321017. The next prime is 113112231321127. The reversal of 113112231321032 is 230123132211311.
It can be written as a sum of positive squares in only one way, i.e., 89433827646916 + 23678403674116 = 9456946^2 + 4866046^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-4 number, since 4×1131122313210324 (a number of 57 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113112231320992 and 113112231321010.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7069514457557 + ... + 7069514457572.
Almost surely, 2113112231321032 is an apocalyptic number.
It is an amenable number.
113112231321032 is a deficient number, since it is larger than the sum of its proper divisors (98973202405918).
113112231321032 is a wasteful number, since it uses less digits than its factorization.
113112231321032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14139028915135 (or 14139028915131 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 113112231321032 its reverse (230123132211311), we get a palindrome (343235363532343).
The spelling of 113112231321032 in words is "one hundred thirteen trillion, one hundred twelve billion, two hundred thirty-one million, three hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •