Base | Representation |
---|---|
bin | 11100000010001010… |
… | …10011011100101111 |
3 | 1102211220021022112220 |
4 | 32001011103130233 |
5 | 221310420200020 |
6 | 10525241330423 |
7 | 1041652406442 |
oct | 160105233457 |
9 | 42756238486 |
10 | 15050553135 |
11 | 6423710372 |
12 | 2b00496a13 |
13 | 155b169157 |
14 | a2ac23659 |
15 | 5d149d240 |
hex | 38115372f |
15050553135 has 32 divisors (see below), whose sum is σ = 25506524160. Its totient is φ = 7552086528.
The previous prime is 15050553127. The next prime is 15050553137. The reversal of 15050553135 is 53135505051.
15050553135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15050553135 - 23 = 15050553127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15050553096 and 15050553105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15050553137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 837454 + ... + 855236.
It is an arithmetic number, because the mean of its divisors is an integer number (797078880).
Almost surely, 215050553135 is an apocalyptic number.
15050553135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
15050553135 is a deficient number, since it is larger than the sum of its proper divisors (10455971025).
15050553135 is a wasteful number, since it uses less digits than its factorization.
15050553135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21127.
The product of its (nonzero) digits is 28125, while the sum is 33.
The spelling of 15050553135 in words is "fifteen billion, fifty million, five hundred fifty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •