Base | Representation |
---|---|
bin | 11100001100011000… |
… | …10000101111011101 |
3 | 1110001212112211120021 |
4 | 32012030100233131 |
5 | 221444340410013 |
6 | 10541542352141 |
7 | 1044043054015 |
oct | 160614205735 |
9 | 43055484507 |
10 | 15136263133 |
11 | 6468031582 |
12 | 2b2512b651 |
13 | 1572b48524 |
14 | a38374c45 |
15 | 5d8c7da8d |
hex | 386310bdd |
15136263133 has 8 divisors (see below), whose sum is σ = 15302146496. Its totient is φ = 14970744000.
The previous prime is 15136263101. The next prime is 15136263137. The reversal of 15136263133 is 33136263151.
15136263133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 15136263133 - 25 = 15136263101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15136263137) 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 7 ways as a sum of consecutive naturals, for example, 7068 + ... + 174133.
It is an arithmetic number, because the mean of its divisors is an integer number (1912768312).
Almost surely, 215136263133 is an apocalyptic number.
It is an amenable number.
15136263133 is a deficient number, since it is larger than the sum of its proper divisors (165883363).
15136263133 is a wasteful number, since it uses less digits than its factorization.
15136263133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182115.
The product of its digits is 29160, while the sum is 34.
The spelling of 15136263133 in words is "fifteen billion, one hundred thirty-six million, two hundred sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •