Base | Representation |
---|---|
bin | 10111011011000010101000… |
… | …111101001001101101100000 |
3 | 111111201222102002202122202012 |
4 | 113123002220331021231200 |
5 | 102000232300014330422 |
6 | 1003031400503212052 |
7 | 30461316232401101 |
oct | 2733025075115540 |
9 | 444658362678665 |
10 | 103013330230112 |
11 | 2a9067873aa055 |
12 | b67880ba47028 |
13 | 456316659b273 |
14 | 1b61c2c2763a8 |
15 | bd992e4464e2 |
hex | 5db0a8f49b60 |
103013330230112 has 48 divisors (see below), whose sum is σ = 209149767187200. Its totient is φ = 49920520433280.
The previous prime is 103013330230067. The next prime is 103013330230127. The reversal of 103013330230112 is 211032033310301.
It is a super-2 number, since 2×1030133302301122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 384106412 + ... + 384374507.
It is an arithmetic number, because the mean of its divisors is an integer number (4357286816400).
Almost surely, 2103013330230112 is an apocalyptic number.
It is an amenable number.
103013330230112 is an abundant number, since it is smaller than the sum of its proper divisors (106136436957088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103013330230112 is an equidigital number, since it uses as much as digits as its factorization.
103013330230112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768481059 (or 768481051 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 103013330230112 its reverse (211032033310301), we get a palindrome (314045363540413).
The spelling of 103013330230112 in words is "one hundred three trillion, thirteen billion, three hundred thirty million, two hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •