Base | Representation |
---|---|
bin | 11100010100001010… |
… | …01111100011100101 |
3 | 1110020102100211210122 |
4 | 32022011033203211 |
5 | 222113043012013 |
6 | 10552233331325 |
7 | 1045464614444 |
oct | 161205174345 |
9 | 43212324718 |
10 | 15201532133 |
11 | 64a09610a7 |
12 | 2b42b66b45 |
13 | 158351b838 |
14 | a42cc4d5b |
15 | 5de872a08 |
hex | 38a14f8e5 |
15201532133 has 16 divisors (see below), whose sum is σ = 15765840000. Its totient is φ = 14647988160.
The previous prime is 15201532111. The next prime is 15201532147. The reversal of 15201532133 is 33123510251.
15201532133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 15201532133 - 218 = 15201269989 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 (15201532183) 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 15 ways as a sum of consecutive naturals, for example, 5067368 + ... + 5070366.
It is an arithmetic number, because the mean of its divisors is an integer number (985365000).
Almost surely, 215201532133 is an apocalyptic number.
It is an amenable number.
15201532133 is a deficient number, since it is larger than the sum of its proper divisors (564307867).
15201532133 is a wasteful number, since it uses less digits than its factorization.
15201532133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4732.
The product of its (nonzero) digits is 2700, while the sum is 26.
The spelling of 15201532133 in words is "fifteen billion, two hundred one million, five hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •