Base | Representation |
---|---|
bin | 10111011111011010000001… |
… | …111011001001001110010101 |
3 | 111112210122202010021121002211 |
4 | 113133122001323021032111 |
5 | 102020141141203300000 |
6 | 1003421252503433421 |
7 | 30522066312631162 |
oct | 2737320173111625 |
9 | 445718663247084 |
10 | 103313323103125 |
11 | 2aa11a30578783 |
12 | b706992a55871 |
13 | 4585534aa2c05 |
14 | 1b7256a481069 |
15 | be263b1987ba |
hex | 5df681ec9395 |
103313323103125 has 48 divisors (see below), whose sum is σ = 130402612948608. Its totient is φ = 81838494360000.
The previous prime is 103313323103063. The next prime is 103313323103131. The reversal of 103313323103125 is 521301323313301.
It is a happy number.
It is not a de Polignac number, because 103313323103125 - 217 = 103313322972053 is a prime.
It is a super-2 number, since 2×1033133231031252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4028896554 + ... + 4028922196.
It is an arithmetic number, because the mean of its divisors is an integer number (2716721103096).
Almost surely, 2103313323103125 is an apocalyptic number.
It is an amenable number.
103313323103125 is a deficient number, since it is larger than the sum of its proper divisors (27089289845483).
103313323103125 is an equidigital number, since it uses as much as digits as its factorization.
103313323103125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38288 (or 38268 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 31.
Adding to 103313323103125 its reverse (521301323313301), we get a palindrome (624614646416426).
The spelling of 103313323103125 in words is "one hundred three trillion, three hundred thirteen billion, three hundred twenty-three million, one hundred three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.417 sec. • engine limits •