Base | Representation |
---|---|
bin | 10110101000111111… |
… | …01010000100100101 |
3 | 1011101002210010201201 |
4 | 23110133222010211 |
5 | 144343140100143 |
6 | 5330043522501 |
7 | 610132552015 |
oct | 132437520445 |
9 | 34332703651 |
10 | 12155003173 |
11 | 5178200875 |
12 | 2432829431 |
13 | 11b92c5a91 |
14 | 834449c45 |
15 | 4b218c64d |
hex | 2d47ea125 |
12155003173 has 2 divisors, whose sum is σ = 12155003174. Its totient is φ = 12155003172.
The previous prime is 12155003153. The next prime is 12155003207. The reversal of 12155003173 is 37130055121.
12155003173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10249942564 + 1905060609 = 101242^2 + 43647^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12155003173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12155003153) 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 as a sum of consecutive naturals, namely, 6077501586 + 6077501587.
It is an arithmetic number, because the mean of its divisors is an integer number (6077501587).
Almost surely, 212155003173 is an apocalyptic number.
It is an amenable number.
12155003173 is a deficient number, since it is larger than the sum of its proper divisors (1).
12155003173 is an equidigital number, since it uses as much as digits as its factorization.
12155003173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 28.
Adding to 12155003173 its reverse (37130055121), we get a palindrome (49285058294).
The spelling of 12155003173 in words is "twelve billion, one hundred fifty-five million, three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •