Base | Representation |
---|---|
bin | 11100000010101101… |
… | …01011111111110011 |
3 | 1102212012211211120112 |
4 | 32001112223333303 |
5 | 221313102011011 |
6 | 10525523131535 |
7 | 1042036216235 |
oct | 160126537763 |
9 | 42765754515 |
10 | 15055110131 |
11 | 6426243086 |
12 | 2b01b13bab |
13 | 155c0a33b9 |
14 | a2b68c255 |
15 | 5d1a9d58b |
hex | 3815abff3 |
15055110131 has 8 divisors (see below), whose sum is σ = 15133361520. Its totient is φ = 14976967968.
The previous prime is 15055110071. The next prime is 15055110139. The reversal of 15055110131 is 13101155051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15055110131 - 26 = 15055110067 is a prime.
It is a super-2 number, since 2×150551101312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15055110097 and 15055110106.
It is not an unprimeable number, because it can be changed into a prime (15055110139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 256700 + ... + 309846.
It is an arithmetic number, because the mean of its divisors is an integer number (1891670190).
Almost surely, 215055110131 is an apocalyptic number.
15055110131 is a deficient number, since it is larger than the sum of its proper divisors (78251389).
15055110131 is a wasteful number, since it uses less digits than its factorization.
15055110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54613.
The product of its (nonzero) digits is 375, while the sum is 23.
Adding to 15055110131 its reverse (13101155051), we get a palindrome (28156265182).
The spelling of 15055110131 in words is "fifteen billion, fifty-five million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •