Base | Representation |
---|---|
bin | 1101101100000011011111… |
… | …1100100010000101110101 |
3 | 1222021210222111120102210110 |
4 | 3123000313330202011311 |
5 | 3433041413012122331 |
6 | 52002034530013233 |
7 | 3112235343242316 |
oct | 333006774420565 |
9 | 58253874512713 |
10 | 15050504020341 |
11 | 4882979176569 |
12 | 1830a7b417219 |
13 | 85234452149a |
14 | 3a063c12660d |
15 | 1b17713b8946 |
hex | db037f22175 |
15050504020341 has 16 divisors (see below), whose sum is σ = 20134804304384. Its totient is φ = 9999943359984.
The previous prime is 15050504020319. The next prime is 15050504020429. The reversal of 15050504020341 is 14302040505051.
It is not a de Polignac number, because 15050504020341 - 211 = 15050504018293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15050504020299 and 15050504020308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15050504020301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8033880 + ... + 9728526.
It is an arithmetic number, because the mean of its divisors is an integer number (1258425269024).
Almost surely, 215050504020341 is an apocalyptic number.
It is an amenable number.
15050504020341 is a deficient number, since it is larger than the sum of its proper divisors (5084300284043).
15050504020341 is a wasteful number, since it uses less digits than its factorization.
15050504020341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1704600.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 15050504020341 its reverse (14302040505051), we get a palindrome (29352544525392).
The spelling of 15050504020341 in words is "fifteen trillion, fifty billion, five hundred four million, twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •