Base | Representation |
---|---|
bin | 10111011011000000011111… |
… | …110111101010010011000100 |
3 | 111111201202110211001201101210 |
4 | 113123000133313222103010 |
5 | 102000213042224442012 |
6 | 1003030340344051420 |
7 | 30461205234410625 |
oct | 2733003767522304 |
9 | 444652424051353 |
10 | 103011030312132 |
11 | 2a905807134698 |
12 | b678289763b70 |
13 | 4562b8ac54557 |
14 | 1b61a90a29a4c |
15 | bd984758e23c |
hex | 5db01fdea4c4 |
103011030312132 has 24 divisors (see below), whose sum is σ = 240390535672000. Its totient is φ = 34332515112096.
The previous prime is 103011030312089. The next prime is 103011030312163. The reversal of 103011030312132 is 231213030110301.
It is a happy number.
It is a super-2 number, since 2×1030110303121322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011030312099 and 103011030312108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 561778507 + ... + 561961842.
Almost surely, 2103011030312132 is an apocalyptic number.
103011030312132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103011030312132 is an abundant number, since it is smaller than the sum of its proper divisors (137379505359868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103011030312132 is a wasteful number, since it uses less digits than its factorization.
103011030312132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1123747995 (or 1123747993 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 103011030312132 its reverse (231213030110301), we get a palindrome (334224060422433).
The spelling of 103011030312132 in words is "one hundred three trillion, eleven billion, thirty million, three hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •