Base | Representation |
---|---|
bin | 11100000001101100… |
… | …00010101001000101 |
3 | 1102211121202001012122 |
4 | 32000312002221011 |
5 | 221303404132013 |
6 | 10525015455325 |
7 | 1041603403634 |
oct | 160066025105 |
9 | 42747661178 |
10 | 15046552133 |
11 | 6421428358 |
12 | 2abb087545 |
13 | 155a397cb2 |
14 | a2a4a151b |
15 | 5d0e5ca08 |
hex | 380d82a45 |
15046552133 has 2 divisors, whose sum is σ = 15046552134. Its totient is φ = 15046552132.
The previous prime is 15046552121. The next prime is 15046552139. The reversal of 15046552133 is 33125564051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12728803684 + 2317748449 = 112822^2 + 48143^2 .
It is a cyclic number.
It is not a de Polignac number, because 15046552133 - 216 = 15046486597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15046552093 and 15046552102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15046552139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7523276066 + 7523276067.
It is an arithmetic number, because the mean of its divisors is an integer number (7523276067).
Almost surely, 215046552133 is an apocalyptic number.
It is an amenable number.
15046552133 is a deficient number, since it is larger than the sum of its proper divisors (1).
15046552133 is an equidigital number, since it uses as much as digits as its factorization.
15046552133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 35.
The spelling of 15046552133 in words is "fifteen billion, forty-six million, five hundred fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •