Base | Representation |
---|---|
bin | 101111111110100111… |
… | …0010001100010110100 |
3 | 100211221112001200010110 |
4 | 1133331032101202310 |
5 | 3142002323002312 |
6 | 115155454423020 |
7 | 10305146602530 |
oct | 1377516214264 |
9 | 324845050113 |
10 | 103032625332 |
11 | 3a77225a42a |
12 | 17b75501a70 |
13 | 993cba7bc0 |
14 | 4db5b1abc0 |
15 | 2a305c543c |
hex | 17fd3918b4 |
103032625332 has 48 divisors (see below), whose sum is σ = 295888568192. Its totient is φ = 27173439360.
The previous prime is 103032625331. The next prime is 103032625337. The reversal of 103032625332 is 233526230301.
It is a super-2 number, since 2×1030326253322 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103032625332.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103032625331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47175019 + ... + 47177202.
Almost surely, 2103032625332 is an apocalyptic number.
103032625332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103032625332 is an abundant number, since it is smaller than the sum of its proper divisors (192855942860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032625332 is a wasteful number, since it uses less digits than its factorization.
103032625332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94352248 (or 94352246 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 30.
Adding to 103032625332 its reverse (233526230301), we get a palindrome (336558855633).
The spelling of 103032625332 in words is "one hundred three billion, thirty-two million, six hundred twenty-five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •