Base | Representation |
---|---|
bin | 10111011011000010010110… |
… | …100110001011111101010000 |
3 | 111111201221121122012010110102 |
4 | 113123002112212023331100 |
5 | 102000231132142020422 |
6 | 1003031310141351532 |
7 | 30461305502350544 |
oct | 2733022646137520 |
9 | 444657548163412 |
10 | 103013022220112 |
11 | 2a906639554634 |
12 | b6787448685a8 |
13 | 4563117827624 |
14 | 1b61bdd3b9a24 |
15 | bd99123a4192 |
hex | 5db09698bf50 |
103013022220112 has 20 divisors (see below), whose sum is σ = 199588179402420. Its totient is φ = 51506395277568.
The previous prime is 103013022220079. The next prime is 103013022220187. The reversal of 103013022220112 is 211022220310301.
It can be written as a sum of positive squares in 2 ways, for example, as 63155063304256 + 39857958915856 = 7947016^2 + 6313316^2 .
It is a super-3 number, since 3×1030130222201123 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337748 + ... + 14357580.
It is an arithmetic number, because the mean of its divisors is an integer number (9979408970121).
Almost surely, 2103013022220112 is an apocalyptic number.
It is an amenable number.
103013022220112 is a deficient number, since it is larger than the sum of its proper divisors (96575157182308).
103013022220112 is a wasteful number, since it uses less digits than its factorization.
103013022220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14479070 (or 14479064 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 103013022220112 its reverse (211022220310301), we get a palindrome (314035242530413).
The spelling of 103013022220112 in words is "one hundred three trillion, thirteen billion, twenty-two million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •