Base | Representation |
---|---|
bin | 110000000110111110… |
… | …0010001111101101100 |
3 | 100212200001212100000210 |
4 | 1200031330101331230 |
5 | 3143041124334012 |
6 | 115243354422420 |
7 | 10315124016534 |
oct | 1401574217554 |
9 | 325601770023 |
10 | 103313121132 |
11 | 3a8a6622041 |
12 | 18033431a10 |
13 | 9986037150 |
14 | 50010944c4 |
15 | 2a4a03023c |
hex | 180df11f6c |
103313121132 has 48 divisors (see below), whose sum is σ = 265644727040. Its totient is φ = 31049379648.
The previous prime is 103313121077. The next prime is 103313121173. The reversal of 103313121132 is 231121313301.
It is a happy number.
It is a super-2 number, since 2×1033131211322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103313121099 and 103313121108.
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 in 15 ways as a sum of consecutive naturals, for example, 7694032 + ... + 7707447.
Almost surely, 2103313121132 is an apocalyptic number.
103313121132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103313121132 is an abundant number, since it is smaller than the sum of its proper divisors (162331605908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103313121132 is a wasteful number, since it uses less digits than its factorization.
103313121132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15401542 (or 15401540 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 103313121132 its reverse (231121313301), we get a palindrome (334434434433).
The spelling of 103313121132 in words is "one hundred three billion, three hundred thirteen million, one hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •