Base | Representation |
---|---|
bin | 10111011011000000011110… |
… | …101110110111111000000000 |
3 | 111111201202102111011022022210 |
4 | 113123000132232313320000 |
5 | 102000213022333344412 |
6 | 1003030334423102120 |
7 | 30461204613260316 |
oct | 2733003656677000 |
9 | 444652374138283 |
10 | 103011011231232 |
11 | 2a9057a7391955 |
12 | b6782832a1940 |
13 | 4562b87003590 |
14 | 1b61a8c2a00b6 |
15 | bd9845a7083c |
hex | 5db01ebb7e00 |
103011011231232 has 160 divisors (see below), whose sum is σ = 312922166512032. Its totient is φ = 29831242973184.
The previous prime is 103011011231207. The next prime is 103011011231251. The reversal of 103011011231232 is 232132110110301.
It is a super-2 number, since 2×1030110112312322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011011231199 and 103011011231208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 151390093 + ... + 152069004.
Almost surely, 2103011011231232 is an apocalyptic number.
103011011231232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103011011231232 is an abundant number, since it is smaller than the sum of its proper divisors (209911155280800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103011011231232 is a wasteful number, since it uses less digits than its factorization.
103011011231232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303459148 (or 303459132 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 103011011231232 its reverse (232132110110301), we get a palindrome (335143121341533).
The spelling of 103011011231232 in words is "one hundred three trillion, eleven billion, eleven million, two hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •