Base | Representation |
---|---|
bin | 10111011011000010101000… |
… | …111101001001101101011111 |
3 | 111111201222102002202122202011 |
4 | 113123002220331021231133 |
5 | 102000232300014330421 |
6 | 1003031400503212051 |
7 | 30461316232401100 |
oct | 2733025075115537 |
9 | 444658362678664 |
10 | 103013330230111 |
11 | 2a9067873aa054 |
12 | b67880ba47027 |
13 | 456316659b272 |
14 | 1b61c2c2763a7 |
15 | bd992e4464e1 |
hex | 5db0a8f49b5f |
103013330230111 has 12 divisors (see below), whose sum is σ = 119833187659200. Its totient is φ = 88296142119360.
The previous prime is 103013330230067. The next prime is 103013330230127. The reversal of 103013330230111 is 111032033310301.
It is not a de Polignac number, because 103013330230111 - 211 = 103013330228063 is a prime.
It is a super-2 number, since 2×1030133302301112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103013330239111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7486330 + ... + 16188631.
It is an arithmetic number, because the mean of its divisors is an integer number (9986098971600).
Almost surely, 2103013330230111 is an apocalyptic number.
103013330230111 is a deficient number, since it is larger than the sum of its proper divisors (16819857429089).
103013330230111 is an equidigital number, since it uses as much as digits as its factorization.
103013330230111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23763774 (or 23763767 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 103013330230111 its reverse (111032033310301), we get a palindrome (214045363540412).
The spelling of 103013330230111 in words is "one hundred three trillion, thirteen billion, three hundred thirty million, two hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •