Base | Representation |
---|---|
bin | 10111011011000001011111… |
… | …101100011100010101111100 |
3 | 111111201212020102222001100001 |
4 | 113123001133230130111330 |
5 | 102000222240341110322 |
6 | 1003031034515044044 |
7 | 30461243616152644 |
oct | 2733013754342574 |
9 | 444655212861301 |
10 | 103012101113212 |
11 | 2a906206616365 |
12 | b6785282a0624 |
13 | 4562ccba50a65 |
14 | 1b61b52d27524 |
15 | bd98ab5a8827 |
hex | 5db05fb1c57c |
103012101113212 has 48 divisors (see below), whose sum is σ = 190070679859200. Its totient is φ = 48777620097600.
The previous prime is 103012101113197. The next prime is 103012101113219. The reversal of 103012101113212 is 212311101210301.
It is a super-2 number, since 2×1030121011132122 (a number of 29 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 103012101113212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103012101113219) 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, 43255539 + ... + 45574837.
It is an arithmetic number, because the mean of its divisors is an integer number (3959805830400).
Almost surely, 2103012101113212 is an apocalyptic number.
It is an amenable number.
103012101113212 is a deficient number, since it is larger than the sum of its proper divisors (87058578745988).
103012101113212 is a wasteful number, since it uses less digits than its factorization.
103012101113212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2327002 (or 2327000 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 103012101113212 its reverse (212311101210301), we get a palindrome (315323202323513).
The spelling of 103012101113212 in words is "one hundred three trillion, twelve billion, one hundred one million, one hundred thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •