Base | Representation |
---|---|
bin | 110001110011… |
… | …100010010111 |
3 | 220120022200011 |
4 | 301303202113 |
5 | 11320244101 |
6 | 1143501051 |
7 | 215655403 |
oct | 61634227 |
9 | 26508604 |
10 | 13056151 |
11 | 7408309 |
12 | 4457787 |
13 | 2921944 |
14 | 1a3c103 |
15 | 122d751 |
hex | c73897 |
13056151 has 2 divisors, whose sum is σ = 13056152. Its totient is φ = 13056150.
The previous prime is 13056107. The next prime is 13056161. The reversal of 13056151 is 15165031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13056151 - 27 = 13056023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13056101) 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, 6528075 + 6528076.
It is an arithmetic number, because the mean of its divisors is an integer number (6528076).
Almost surely, 213056151 is an apocalyptic number.
13056151 is a deficient number, since it is larger than the sum of its proper divisors (1).
13056151 is an equidigital number, since it uses as much as digits as its factorization.
13056151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 22.
The square root of 13056151 is about 3613.3296279194. The cubic root of 13056151 is about 235.4715204553.
The spelling of 13056151 in words is "thirteen million, fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •