Base | Representation |
---|---|
bin | 11100001110000011… |
… | …10011111110111001 |
3 | 1110002211222001001110 |
4 | 32013001303332321 |
5 | 222011434113423 |
6 | 10543203310533 |
7 | 1044303302043 |
oct | 160701637671 |
9 | 43084861043 |
10 | 15150301113 |
11 | 6474a4a512 |
12 | 2b2997b449 |
13 | 1575a2201c |
14 | a3a18aa93 |
15 | 5da103193 |
hex | 387073fb9 |
15150301113 has 4 divisors (see below), whose sum is σ = 20200401488. Its totient is φ = 10100200740.
The previous prime is 15150301039. The next prime is 15150301123. The reversal of 15150301113 is 31110305151.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31110305151 = 3 ⋅10370101717.
It is a de Polignac number, because none of the positive numbers 2k-15150301113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 15150301113.
It is not an unprimeable number, because it can be changed into a prime (15150301123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2525050183 + ... + 2525050188.
It is an arithmetic number, because the mean of its divisors is an integer number (5050100372).
Almost surely, 215150301113 is an apocalyptic number.
It is an amenable number.
15150301113 is a deficient number, since it is larger than the sum of its proper divisors (5050100375).
15150301113 is an equidigital number, since it uses as much as digits as its factorization.
15150301113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5050100374.
The product of its (nonzero) digits is 225, while the sum is 21.
Adding to 15150301113 its reverse (31110305151), we get a palindrome (46260606264).
The spelling of 15150301113 in words is "fifteen billion, one hundred fifty million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •