Base | Representation |
---|---|
bin | 101011110101010001000… |
… | …001000111000101101001 |
3 | 101122221211121111012012112 |
4 | 223311101001013011221 |
5 | 343322321104221134 |
6 | 10223430511452105 |
7 | 430422264530336 |
oct | 53652101070551 |
9 | 11587747435175 |
10 | 3012131320169 |
11 | a6148a671114 |
12 | 407930827035 |
13 | 18b072c5306a |
14 | a5b0613998d |
15 | 535447a41ce |
hex | 2bd51047169 |
3012131320169 has 2 divisors, whose sum is σ = 3012131320170. Its totient is φ = 3012131320168.
The previous prime is 3012131320147. The next prime is 3012131320223. The reversal of 3012131320169 is 9610231312103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2795918410000 + 216212910169 = 1672100^2 + 464987^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3012131320169 is a prime.
It is a super-3 number, since 3×30121313201693 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (3012131320769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506065660084 + 1506065660085.
It is an arithmetic number, because the mean of its divisors is an integer number (1506065660085).
Almost surely, 23012131320169 is an apocalyptic number.
It is an amenable number.
3012131320169 is a deficient number, since it is larger than the sum of its proper divisors (1).
3012131320169 is an equidigital number, since it uses as much as digits as its factorization.
3012131320169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 3012131320169 in words is "three trillion, twelve billion, one hundred thirty-one million, three hundred twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •