Base | Representation |
---|---|
bin | 1101101111101101100011… |
… | …0011111011110000101001 |
3 | 1222111211011010022212001020 |
4 | 3123323120303323300221 |
5 | 3440104101101040410 |
6 | 52050545153043053 |
7 | 3116621316062634 |
oct | 333733063736051 |
9 | 58454133285036 |
10 | 15113332440105 |
11 | 48a758a182219 |
12 | 1841094556489 |
13 | 858247c49523 |
14 | 3a36bc4bac1b |
15 | 1b31ec0bba70 |
hex | dbed8cfbc29 |
15113332440105 has 8 divisors (see below), whose sum is σ = 24181331904192. Its totient is φ = 8060443968048.
The previous prime is 15113332440079. The next prime is 15113332440149. The reversal of 15113332440105 is 50104423331151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 15113332440105 - 27 = 15113332439977 is a prime.
It is a super-2 number, since 2×151133324401052 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 503777747989 + ... + 503777748018.
It is an arithmetic number, because the mean of its divisors is an integer number (3022666488024).
Almost surely, 215113332440105 is an apocalyptic number.
15113332440105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
15113332440105 is a deficient number, since it is larger than the sum of its proper divisors (9067999464087).
15113332440105 is a wasteful number, since it uses less digits than its factorization.
15113332440105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1007555496015.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 15113332440105 its reverse (50104423331151), we get a palindrome (65217755771256).
The spelling of 15113332440105 in words is "fifteen trillion, one hundred thirteen billion, three hundred thirty-two million, four hundred forty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •