Base | Representation |
---|---|
bin | 110001000101100111… |
… | …1100100100011011101 |
3 | 101002002120112121110222 |
4 | 1202023033210203131 |
5 | 3211342311030023 |
6 | 120232132211125 |
7 | 10421201343440 |
oct | 1421317444335 |
9 | 332076477428 |
10 | 105415330013 |
11 | 40785229754 |
12 | 1851b469aa5 |
13 | 9c2c719526 |
14 | 5160357657 |
15 | 2b1e881cc8 |
hex | 188b3e48dd |
105415330013 has 8 divisors (see below), whose sum is σ = 120662616000. Its totient is φ = 90215032320.
The previous prime is 105415329989. The next prime is 105415330021. The reversal of 105415330013 is 310033514501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105415330013 - 26 = 105415329949 is a prime.
It is a super-2 number, since 2×1054153300132 (a number of 23 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 (105415332013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11742263 + ... + 11751236.
It is an arithmetic number, because the mean of its divisors is an integer number (15082827000).
Almost surely, 2105415330013 is an apocalyptic number.
It is an amenable number.
105415330013 is a deficient number, since it is larger than the sum of its proper divisors (15247285987).
105415330013 is an equidigital number, since it uses as much as digits as its factorization.
105415330013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23494147.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 105415330013 its reverse (310033514501), we get a palindrome (415448844514).
The spelling of 105415330013 in words is "one hundred five billion, four hundred fifteen million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •